TPTP Problem File: ITP032^2.p
View Solutions
- Solve Problem
%------------------------------------------------------------------------------
% File : ITP032^2 : TPTP v8.2.0. Released v7.5.0.
% Domain : Interactive Theorem Proving
% Problem : Sledgehammer BinaryTree problem prob_359__3253628_1
% Version : Especial.
% English :
% Refs : [BH+15] Blanchette et al. (2015), Mining the Archive of Formal
% : [Des21] Desharnais (2021), Email to Geoff Sutcliffe
% Source : [Des21]
% Names : BinaryTree/prob_359__3253628_1 [Des21]
% Status : Theorem
% Rating : 0.00 v7.5.0
% Syntax : Number of formulae : 358 ( 137 unt; 57 typ; 0 def)
% Number of atoms : 747 ( 284 equ; 0 cnn)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 3401 ( 90 ~; 20 |; 57 &;2911 @)
% ( 0 <=>; 323 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 7 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 197 ( 197 >; 0 *; 0 +; 0 <<)
% Number of symbols : 58 ( 55 usr; 7 con; 0-5 aty)
% Number of variables : 1039 ( 84 ^; 864 !; 42 ?;1039 :)
% ( 49 !>; 0 ?*; 0 @-; 0 @+)
% SPC : TH1_THM_EQU_NAR
% Comments : This file was generated by Sledgehammer 2021-02-23 16:16:19.593
%------------------------------------------------------------------------------
% Could-be-implicit typings (4)
thf(ty_t_BinaryTree__Mirabelle__pchhvghoao_OTree,type,
binary1291135688e_Tree: $tType > $tType ).
thf(ty_t_Set_Oset,type,
set: $tType > $tType ).
thf(ty_t_Int_Oint,type,
int: $tType ).
thf(ty_tf_a,type,
a: $tType ).
% Explicit typings (53)
thf(sy_cl_Lattices_Obounded__lattice,type,
bounded_lattice:
!>[A: $tType] : $o ).
thf(sy_cl_HOL_Otype,type,
type:
!>[A: $tType] : $o ).
thf(sy_cl_Groups_Ominus,type,
minus:
!>[A: $tType] : $o ).
thf(sy_cl_Orderings_Obot,type,
bot:
!>[A: $tType] : $o ).
thf(sy_cl_Orderings_Oord,type,
ord:
!>[A: $tType] : $o ).
thf(sy_cl_Orderings_Oorder,type,
order:
!>[A: $tType] : $o ).
thf(sy_cl_Groups_Ogroup__add,type,
group_add:
!>[A: $tType] : $o ).
thf(sy_cl_Lattices_Olattice,type,
lattice:
!>[A: $tType] : $o ).
thf(sy_cl_Orderings_Ono__bot,type,
no_bot:
!>[A: $tType] : $o ).
thf(sy_cl_Orderings_Ono__top,type,
no_top:
!>[A: $tType] : $o ).
thf(sy_cl_Orderings_Olinorder,type,
linorder:
!>[A: $tType] : $o ).
thf(sy_cl_Orderings_Opreorder,type,
preorder:
!>[A: $tType] : $o ).
thf(sy_cl_Orderings_Oorder__bot,type,
order_bot:
!>[A: $tType] : $o ).
thf(sy_cl_Orderings_Owellorder,type,
wellorder:
!>[A: $tType] : $o ).
thf(sy_cl_Orderings_Odense__order,type,
dense_order:
!>[A: $tType] : $o ).
thf(sy_cl_Rings_Olinordered__idom,type,
linordered_idom:
!>[A: $tType] : $o ).
thf(sy_cl_Fields_Olinordered__field,type,
linordered_field:
!>[A: $tType] : $o ).
thf(sy_cl_Lattices_Osemilattice__sup,type,
semilattice_sup:
!>[A: $tType] : $o ).
thf(sy_cl_Groups_Oordered__ab__group__add,type,
ordered_ab_group_add:
!>[A: $tType] : $o ).
thf(sy_cl_Groups_Ocancel__ab__semigroup__add,type,
cancel146912293up_add:
!>[A: $tType] : $o ).
thf(sy_cl_Lattices_Obounded__semilattice__sup__bot,type,
bounde1808546759up_bot:
!>[A: $tType] : $o ).
thf(sy_cl_Conditionally__Complete__Lattices_Olinear__continuum,type,
condit1656338222tinuum:
!>[A: $tType] : $o ).
thf(sy_c_BinaryTree__Mirabelle__pchhvghoao_OTree_OT,type,
binary210054475elle_T:
!>[A: $tType] : ( ( binary1291135688e_Tree @ A ) > A > ( binary1291135688e_Tree @ A ) > ( binary1291135688e_Tree @ A ) ) ).
thf(sy_c_BinaryTree__Mirabelle__pchhvghoao_OTree_OTip,type,
binary1746293266le_Tip:
!>[A: $tType] : ( binary1291135688e_Tree @ A ) ).
thf(sy_c_BinaryTree__Mirabelle__pchhvghoao_OTree_Ocase__Tree,type,
binary536355927e_Tree:
!>[B: $tType,A: $tType] : ( B > ( ( binary1291135688e_Tree @ A ) > A > ( binary1291135688e_Tree @ A ) > B ) > ( binary1291135688e_Tree @ A ) > B ) ).
thf(sy_c_BinaryTree__Mirabelle__pchhvghoao_OTree_Opred__Tree,type,
binary1693644968d_Tree:
!>[A: $tType] : ( ( A > $o ) > ( binary1291135688e_Tree @ A ) > $o ) ).
thf(sy_c_BinaryTree__Mirabelle__pchhvghoao_OTree_Orec__Tree,type,
binary1929596613c_Tree:
!>[C: $tType,A: $tType] : ( C > ( ( binary1291135688e_Tree @ A ) > A > ( binary1291135688e_Tree @ A ) > C > C > C ) > ( binary1291135688e_Tree @ A ) > C ) ).
thf(sy_c_BinaryTree__Mirabelle__pchhvghoao_OTree_Oset__Tree,type,
binary2130109271t_Tree:
!>[A: $tType] : ( ( binary1291135688e_Tree @ A ) > ( set @ A ) ) ).
thf(sy_c_BinaryTree__Mirabelle__pchhvghoao_Obinsert,type,
binary1830089824insert:
!>[A: $tType] : ( ( A > int ) > A > ( binary1291135688e_Tree @ A ) > ( binary1291135688e_Tree @ A ) ) ).
thf(sy_c_BinaryTree__Mirabelle__pchhvghoao_Oeqs,type,
binary64540844le_eqs:
!>[A: $tType] : ( ( A > int ) > A > ( set @ A ) ) ).
thf(sy_c_BinaryTree__Mirabelle__pchhvghoao_Omemb,type,
binary827270440e_memb:
!>[A: $tType] : ( ( A > int ) > A > ( binary1291135688e_Tree @ A ) > $o ) ).
thf(sy_c_BinaryTree__Mirabelle__pchhvghoao_OsetOf,type,
binary1653327646_setOf:
!>[A: $tType] : ( ( binary1291135688e_Tree @ A ) > ( set @ A ) ) ).
thf(sy_c_BinaryTree__Mirabelle__pchhvghoao_OsortedTree,type,
binary1610619414edTree:
!>[A: $tType] : ( ( A > int ) > ( binary1291135688e_Tree @ A ) > $o ) ).
thf(sy_c_BinaryTree__Mirabelle__pchhvghoao_Osorted__distinct__pred,type,
binary231205461t_pred:
!>[A: $tType] : ( ( A > int ) > A > A > ( binary1291135688e_Tree @ A ) > $o ) ).
thf(sy_c_Groups_Ominus__class_Ominus,type,
minus_minus:
!>[A: $tType] : ( A > A > A ) ).
thf(sy_c_HOL_OThe,type,
the:
!>[A: $tType] : ( ( A > $o ) > A ) ).
thf(sy_c_Lattices_Osup__class_Osup,type,
sup_sup:
!>[A: $tType] : ( A > A > A ) ).
thf(sy_c_Orderings_Obot__class_Obot,type,
bot_bot:
!>[A: $tType] : A ).
thf(sy_c_Orderings_Oord__class_Oless,type,
ord_less:
!>[A: $tType] : ( A > A > $o ) ).
thf(sy_c_Orderings_Oord__class_Oless__eq,type,
ord_less_eq:
!>[A: $tType] : ( A > A > $o ) ).
thf(sy_c_Set_OCollect,type,
collect:
!>[A: $tType] : ( ( A > $o ) > ( set @ A ) ) ).
thf(sy_c_Set_Oinsert,type,
insert:
!>[A: $tType] : ( A > ( set @ A ) > ( set @ A ) ) ).
thf(sy_c_Set_Ois__empty,type,
is_empty:
!>[A: $tType] : ( ( set @ A ) > $o ) ).
thf(sy_c_Set_Ois__singleton,type,
is_singleton:
!>[A: $tType] : ( ( set @ A ) > $o ) ).
thf(sy_c_Set_Oremove,type,
remove:
!>[A: $tType] : ( A > ( set @ A ) > ( set @ A ) ) ).
thf(sy_c_Set_Othe__elem,type,
the_elem:
!>[A: $tType] : ( ( set @ A ) > A ) ).
thf(sy_c_member,type,
member:
!>[A: $tType] : ( A > ( set @ A ) > $o ) ).
thf(sy_v_e,type,
e: a ).
thf(sy_v_h,type,
h: a > int ).
thf(sy_v_t1____,type,
t1: binary1291135688e_Tree @ a ).
thf(sy_v_t2____,type,
t2: binary1291135688e_Tree @ a ).
thf(sy_v_w____,type,
w: a ).
thf(sy_v_x____,type,
x: a ).
% Relevant facts (256)
thf(fact_0_whSet,axiom,
member @ a @ w @ ( binary1653327646_setOf @ a @ t1 ) ).
% whSet
thf(fact_1_s,axiom,
binary1610619414edTree @ a @ h @ ( binary210054475elle_T @ a @ t1 @ x @ t2 ) ).
% s
thf(fact_2_s2,axiom,
binary1610619414edTree @ a @ h @ t2 ).
% s2
thf(fact_3_s1,axiom,
binary1610619414edTree @ a @ h @ t1 ).
% s1
thf(fact_4_eNotLess,axiom,
~ ( ord_less @ int @ ( h @ e ) @ ( h @ x ) ) ).
% eNotLess
thf(fact_5_xNotLess,axiom,
~ ( ord_less @ int @ ( h @ x ) @ ( h @ e ) ) ).
% xNotLess
thf(fact_6_whEq,axiom,
member @ a @ w @ ( binary64540844le_eqs @ a @ h @ e ) ).
% whEq
thf(fact_7_xeqe,axiom,
( ( h @ x )
= ( h @ e ) ) ).
% xeqe
thf(fact_8_Tree_Oinject,axiom,
! [A: $tType,X21: binary1291135688e_Tree @ A,X22: A,X23: binary1291135688e_Tree @ A,Y21: binary1291135688e_Tree @ A,Y22: A,Y23: binary1291135688e_Tree @ A] :
( ( ( binary210054475elle_T @ A @ X21 @ X22 @ X23 )
= ( binary210054475elle_T @ A @ Y21 @ Y22 @ Y23 ) )
= ( ( X21 = Y21 )
& ( X22 = Y22 )
& ( X23 = Y23 ) ) ) ).
% Tree.inject
thf(fact_9_calculation,axiom,
member @ a @ x @ ( binary64540844le_eqs @ a @ h @ e ) ).
% calculation
thf(fact_10_minf_I11_J,axiom,
! [C: $tType,D: $tType] :
( ( ord @ C )
=> ! [F: D] :
? [Z: C] :
! [X: C] :
( ( ord_less @ C @ X @ Z )
=> ( F = F ) ) ) ).
% minf(11)
thf(fact_11_minf_I7_J,axiom,
! [A: $tType] :
( ( linorder @ A )
=> ! [T: A] :
? [Z: A] :
! [X: A] :
( ( ord_less @ A @ X @ Z )
=> ~ ( ord_less @ A @ T @ X ) ) ) ).
% minf(7)
thf(fact_12_minf_I5_J,axiom,
! [A: $tType] :
( ( linorder @ A )
=> ! [T: A] :
? [Z: A] :
! [X: A] :
( ( ord_less @ A @ X @ Z )
=> ( ord_less @ A @ X @ T ) ) ) ).
% minf(5)
thf(fact_13_minf_I4_J,axiom,
! [A: $tType] :
( ( linorder @ A )
=> ! [T: A] :
? [Z: A] :
! [X: A] :
( ( ord_less @ A @ X @ Z )
=> ( X != T ) ) ) ).
% minf(4)
thf(fact_14_minf_I3_J,axiom,
! [A: $tType] :
( ( linorder @ A )
=> ! [T: A] :
? [Z: A] :
! [X: A] :
( ( ord_less @ A @ X @ Z )
=> ( X != T ) ) ) ).
% minf(3)
thf(fact_15_minf_I2_J,axiom,
! [A: $tType] :
( ( linorder @ A )
=> ! [P: A > $o,P2: A > $o,Q: A > $o,Q2: A > $o] :
( ? [Z2: A] :
! [X2: A] :
( ( ord_less @ A @ X2 @ Z2 )
=> ( ( P @ X2 )
= ( P2 @ X2 ) ) )
=> ( ? [Z2: A] :
! [X2: A] :
( ( ord_less @ A @ X2 @ Z2 )
=> ( ( Q @ X2 )
= ( Q2 @ X2 ) ) )
=> ? [Z: A] :
! [X: A] :
( ( ord_less @ A @ X @ Z )
=> ( ( ( P @ X )
| ( Q @ X ) )
= ( ( P2 @ X )
| ( Q2 @ X ) ) ) ) ) ) ) ).
% minf(2)
thf(fact_16_minf_I1_J,axiom,
! [A: $tType] :
( ( linorder @ A )
=> ! [P: A > $o,P2: A > $o,Q: A > $o,Q2: A > $o] :
( ? [Z2: A] :
! [X2: A] :
( ( ord_less @ A @ X2 @ Z2 )
=> ( ( P @ X2 )
= ( P2 @ X2 ) ) )
=> ( ? [Z2: A] :
! [X2: A] :
( ( ord_less @ A @ X2 @ Z2 )
=> ( ( Q @ X2 )
= ( Q2 @ X2 ) ) )
=> ? [Z: A] :
! [X: A] :
( ( ord_less @ A @ X @ Z )
=> ( ( ( P @ X )
& ( Q @ X ) )
= ( ( P2 @ X )
& ( Q2 @ X ) ) ) ) ) ) ) ).
% minf(1)
thf(fact_17_pinf_I11_J,axiom,
! [C: $tType,D: $tType] :
( ( ord @ C )
=> ! [F: D] :
? [Z: C] :
! [X: C] :
( ( ord_less @ C @ Z @ X )
=> ( F = F ) ) ) ).
% pinf(11)
thf(fact_18_res,axiom,
( ( binary1830089824insert @ a @ h @ e @ ( binary210054475elle_T @ a @ t1 @ x @ t2 ) )
= ( binary210054475elle_T @ a @ t1 @ e @ t2 ) ) ).
% res
thf(fact_19_sortLemmaR,axiom,
! [A: $tType,H: A > int,T1: binary1291135688e_Tree @ A,X3: A,T2: binary1291135688e_Tree @ A] :
( ( binary1610619414edTree @ A @ H @ ( binary210054475elle_T @ A @ T1 @ X3 @ T2 ) )
=> ( binary1610619414edTree @ A @ H @ T2 ) ) ).
% sortLemmaR
thf(fact_20_sortLemmaL,axiom,
! [A: $tType,H: A > int,T1: binary1291135688e_Tree @ A,X3: A,T2: binary1291135688e_Tree @ A] :
( ( binary1610619414edTree @ A @ H @ ( binary210054475elle_T @ A @ T1 @ X3 @ T2 ) )
=> ( binary1610619414edTree @ A @ H @ T1 ) ) ).
% sortLemmaL
thf(fact_21_sortedTree_Osimps_I2_J,axiom,
! [A: $tType,H: A > int,T1: binary1291135688e_Tree @ A,X3: A,T2: binary1291135688e_Tree @ A] :
( ( binary1610619414edTree @ A @ H @ ( binary210054475elle_T @ A @ T1 @ X3 @ T2 ) )
= ( ( binary1610619414edTree @ A @ H @ T1 )
& ! [X4: A] :
( ( member @ A @ X4 @ ( binary1653327646_setOf @ A @ T1 ) )
=> ( ord_less @ int @ ( H @ X4 ) @ ( H @ X3 ) ) )
& ! [X4: A] :
( ( member @ A @ X4 @ ( binary1653327646_setOf @ A @ T2 ) )
=> ( ord_less @ int @ ( H @ X3 ) @ ( H @ X4 ) ) )
& ( binary1610619414edTree @ A @ H @ T2 ) ) ) ).
% sortedTree.simps(2)
thf(fact_22_pinf_I1_J,axiom,
! [A: $tType] :
( ( linorder @ A )
=> ! [P: A > $o,P2: A > $o,Q: A > $o,Q2: A > $o] :
( ? [Z2: A] :
! [X2: A] :
( ( ord_less @ A @ Z2 @ X2 )
=> ( ( P @ X2 )
= ( P2 @ X2 ) ) )
=> ( ? [Z2: A] :
! [X2: A] :
( ( ord_less @ A @ Z2 @ X2 )
=> ( ( Q @ X2 )
= ( Q2 @ X2 ) ) )
=> ? [Z: A] :
! [X: A] :
( ( ord_less @ A @ Z @ X )
=> ( ( ( P @ X )
& ( Q @ X ) )
= ( ( P2 @ X )
& ( Q2 @ X ) ) ) ) ) ) ) ).
% pinf(1)
thf(fact_23_pinf_I2_J,axiom,
! [A: $tType] :
( ( linorder @ A )
=> ! [P: A > $o,P2: A > $o,Q: A > $o,Q2: A > $o] :
( ? [Z2: A] :
! [X2: A] :
( ( ord_less @ A @ Z2 @ X2 )
=> ( ( P @ X2 )
= ( P2 @ X2 ) ) )
=> ( ? [Z2: A] :
! [X2: A] :
( ( ord_less @ A @ Z2 @ X2 )
=> ( ( Q @ X2 )
= ( Q2 @ X2 ) ) )
=> ? [Z: A] :
! [X: A] :
( ( ord_less @ A @ Z @ X )
=> ( ( ( P @ X )
| ( Q @ X ) )
= ( ( P2 @ X )
| ( Q2 @ X ) ) ) ) ) ) ) ).
% pinf(2)
thf(fact_24_pinf_I3_J,axiom,
! [A: $tType] :
( ( linorder @ A )
=> ! [T: A] :
? [Z: A] :
! [X: A] :
( ( ord_less @ A @ Z @ X )
=> ( X != T ) ) ) ).
% pinf(3)
thf(fact_25_pinf_I4_J,axiom,
! [A: $tType] :
( ( linorder @ A )
=> ! [T: A] :
? [Z: A] :
! [X: A] :
( ( ord_less @ A @ Z @ X )
=> ( X != T ) ) ) ).
% pinf(4)
thf(fact_26_pinf_I5_J,axiom,
! [A: $tType] :
( ( linorder @ A )
=> ! [T: A] :
? [Z: A] :
! [X: A] :
( ( ord_less @ A @ Z @ X )
=> ~ ( ord_less @ A @ X @ T ) ) ) ).
% pinf(5)
thf(fact_27_pinf_I7_J,axiom,
! [A: $tType] :
( ( linorder @ A )
=> ! [T: A] :
? [Z: A] :
! [X: A] :
( ( ord_less @ A @ Z @ X )
=> ( ord_less @ A @ T @ X ) ) ) ).
% pinf(7)
thf(fact_28_sorted__distinct__pred__def,axiom,
! [A: $tType] :
( ( binary231205461t_pred @ A )
= ( ^ [H2: A > int,A2: A,B2: A,T3: binary1291135688e_Tree @ A] :
( ( ( binary1610619414edTree @ A @ H2 @ T3 )
& ( member @ A @ A2 @ ( binary1653327646_setOf @ A @ T3 ) )
& ( member @ A @ B2 @ ( binary1653327646_setOf @ A @ T3 ) )
& ( ( H2 @ A2 )
= ( H2 @ B2 ) ) )
=> ( A2 = B2 ) ) ) ) ).
% sorted_distinct_pred_def
thf(fact_29_memb__spec,axiom,
! [A: $tType,H: A > int,T: binary1291135688e_Tree @ A,X3: A] :
( ( binary1610619414edTree @ A @ H @ T )
=> ( ( binary827270440e_memb @ A @ H @ X3 @ T )
= ( member @ A @ X3 @ ( binary1653327646_setOf @ A @ T ) ) ) ) ).
% memb_spec
thf(fact_30_binsert_Osimps_I2_J,axiom,
! [A: $tType,H: A > int,E: A,X3: A,T1: binary1291135688e_Tree @ A,T2: binary1291135688e_Tree @ A] :
( ( ( ord_less @ int @ ( H @ E ) @ ( H @ X3 ) )
=> ( ( binary1830089824insert @ A @ H @ E @ ( binary210054475elle_T @ A @ T1 @ X3 @ T2 ) )
= ( binary210054475elle_T @ A @ ( binary1830089824insert @ A @ H @ E @ T1 ) @ X3 @ T2 ) ) )
& ( ~ ( ord_less @ int @ ( H @ E ) @ ( H @ X3 ) )
=> ( ( ( ord_less @ int @ ( H @ X3 ) @ ( H @ E ) )
=> ( ( binary1830089824insert @ A @ H @ E @ ( binary210054475elle_T @ A @ T1 @ X3 @ T2 ) )
= ( binary210054475elle_T @ A @ T1 @ X3 @ ( binary1830089824insert @ A @ H @ E @ T2 ) ) ) )
& ( ~ ( ord_less @ int @ ( H @ X3 ) @ ( H @ E ) )
=> ( ( binary1830089824insert @ A @ H @ E @ ( binary210054475elle_T @ A @ T1 @ X3 @ T2 ) )
= ( binary210054475elle_T @ A @ T1 @ E @ T2 ) ) ) ) ) ) ).
% binsert.simps(2)
thf(fact_31_ex__gt__or__lt,axiom,
! [A: $tType] :
( ( condit1656338222tinuum @ A )
=> ! [A3: A] :
? [B3: A] :
( ( ord_less @ A @ A3 @ B3 )
| ( ord_less @ A @ B3 @ A3 ) ) ) ).
% ex_gt_or_lt
thf(fact_32_linorder__neqE__linordered__idom,axiom,
! [A: $tType] :
( ( linordered_idom @ A )
=> ! [X3: A,Y: A] :
( ( X3 != Y )
=> ( ~ ( ord_less @ A @ X3 @ Y )
=> ( ord_less @ A @ Y @ X3 ) ) ) ) ).
% linorder_neqE_linordered_idom
thf(fact_33_dual__order_Ostrict__implies__not__eq,axiom,
! [A: $tType] :
( ( order @ A )
=> ! [B4: A,A3: A] :
( ( ord_less @ A @ B4 @ A3 )
=> ( A3 != B4 ) ) ) ).
% dual_order.strict_implies_not_eq
thf(fact_34_linordered__field__no__ub,axiom,
! [A: $tType] :
( ( linordered_field @ A )
=> ! [X: A] :
? [X_1: A] : ( ord_less @ A @ X @ X_1 ) ) ).
% linordered_field_no_ub
thf(fact_35_linordered__field__no__lb,axiom,
! [A: $tType] :
( ( linordered_field @ A )
=> ! [X: A] :
? [Y2: A] : ( ord_less @ A @ Y2 @ X ) ) ).
% linordered_field_no_lb
thf(fact_36_order_Ostrict__implies__not__eq,axiom,
! [A: $tType] :
( ( order @ A )
=> ! [A3: A,B4: A] :
( ( ord_less @ A @ A3 @ B4 )
=> ( A3 != B4 ) ) ) ).
% order.strict_implies_not_eq
thf(fact_37_dependent__wellorder__choice,axiom,
! [B: $tType,A: $tType] :
( ( wellorder @ A )
=> ! [P: ( A > B ) > A > B > $o] :
( ! [R: B,F2: A > B,G: A > B,X2: A] :
( ! [Y3: A] :
( ( ord_less @ A @ Y3 @ X2 )
=> ( ( F2 @ Y3 )
= ( G @ Y3 ) ) )
=> ( ( P @ F2 @ X2 @ R )
= ( P @ G @ X2 @ R ) ) )
=> ( ! [X2: A,F2: A > B] :
( ! [Y3: A] :
( ( ord_less @ A @ Y3 @ X2 )
=> ( P @ F2 @ Y3 @ ( F2 @ Y3 ) ) )
=> ? [X_12: B] : ( P @ F2 @ X2 @ X_12 ) )
=> ? [F2: A > B] :
! [X: A] : ( P @ F2 @ X @ ( F2 @ X ) ) ) ) ) ).
% dependent_wellorder_choice
thf(fact_38_sorted__distinct,axiom,
! [A: $tType,H: A > int,A3: A,B4: A,T: binary1291135688e_Tree @ A] : ( binary231205461t_pred @ A @ H @ A3 @ B4 @ T ) ).
% sorted_distinct
thf(fact_39_ord__eq__less__subst,axiom,
! [A: $tType,B: $tType] :
( ( ( ord @ B )
& ( ord @ A ) )
=> ! [A3: A,F3: B > A,B4: B,C2: B] :
( ( A3
= ( F3 @ B4 ) )
=> ( ( ord_less @ B @ B4 @ C2 )
=> ( ! [X2: B,Y2: B] :
( ( ord_less @ B @ X2 @ Y2 )
=> ( ord_less @ A @ ( F3 @ X2 ) @ ( F3 @ Y2 ) ) )
=> ( ord_less @ A @ A3 @ ( F3 @ C2 ) ) ) ) ) ) ).
% ord_eq_less_subst
thf(fact_40_ord__less__eq__subst,axiom,
! [A: $tType,B: $tType] :
( ( ( ord @ B )
& ( ord @ A ) )
=> ! [A3: A,B4: A,F3: A > B,C2: B] :
( ( ord_less @ A @ A3 @ B4 )
=> ( ( ( F3 @ B4 )
= C2 )
=> ( ! [X2: A,Y2: A] :
( ( ord_less @ A @ X2 @ Y2 )
=> ( ord_less @ B @ ( F3 @ X2 ) @ ( F3 @ Y2 ) ) )
=> ( ord_less @ B @ ( F3 @ A3 ) @ C2 ) ) ) ) ) ).
% ord_less_eq_subst
thf(fact_41_order__less__subst1,axiom,
! [A: $tType,B: $tType] :
( ( ( order @ B )
& ( order @ A ) )
=> ! [A3: A,F3: B > A,B4: B,C2: B] :
( ( ord_less @ A @ A3 @ ( F3 @ B4 ) )
=> ( ( ord_less @ B @ B4 @ C2 )
=> ( ! [X2: B,Y2: B] :
( ( ord_less @ B @ X2 @ Y2 )
=> ( ord_less @ A @ ( F3 @ X2 ) @ ( F3 @ Y2 ) ) )
=> ( ord_less @ A @ A3 @ ( F3 @ C2 ) ) ) ) ) ) ).
% order_less_subst1
thf(fact_42_order__less__subst2,axiom,
! [A: $tType,C: $tType] :
( ( ( order @ C )
& ( order @ A ) )
=> ! [A3: A,B4: A,F3: A > C,C2: C] :
( ( ord_less @ A @ A3 @ B4 )
=> ( ( ord_less @ C @ ( F3 @ B4 ) @ C2 )
=> ( ! [X2: A,Y2: A] :
( ( ord_less @ A @ X2 @ Y2 )
=> ( ord_less @ C @ ( F3 @ X2 ) @ ( F3 @ Y2 ) ) )
=> ( ord_less @ C @ ( F3 @ A3 ) @ C2 ) ) ) ) ) ).
% order_less_subst2
thf(fact_43_lt__ex,axiom,
! [A: $tType] :
( ( no_bot @ A )
=> ! [X3: A] :
? [Y2: A] : ( ord_less @ A @ Y2 @ X3 ) ) ).
% lt_ex
thf(fact_44_gt__ex,axiom,
! [A: $tType] :
( ( no_top @ A )
=> ! [X3: A] :
? [X_1: A] : ( ord_less @ A @ X3 @ X_1 ) ) ).
% gt_ex
thf(fact_45_mem__Collect__eq,axiom,
! [A: $tType,A3: A,P: A > $o] :
( ( member @ A @ A3 @ ( collect @ A @ P ) )
= ( P @ A3 ) ) ).
% mem_Collect_eq
thf(fact_46_Collect__mem__eq,axiom,
! [A: $tType,A4: set @ A] :
( ( collect @ A
@ ^ [X4: A] : ( member @ A @ X4 @ A4 ) )
= A4 ) ).
% Collect_mem_eq
thf(fact_47_Collect__cong,axiom,
! [A: $tType,P: A > $o,Q: A > $o] :
( ! [X2: A] :
( ( P @ X2 )
= ( Q @ X2 ) )
=> ( ( collect @ A @ P )
= ( collect @ A @ Q ) ) ) ).
% Collect_cong
thf(fact_48_ext,axiom,
! [B: $tType,A: $tType,F3: A > B,G2: A > B] :
( ! [X2: A] :
( ( F3 @ X2 )
= ( G2 @ X2 ) )
=> ( F3 = G2 ) ) ).
% ext
thf(fact_49_neqE,axiom,
! [A: $tType] :
( ( linorder @ A )
=> ! [X3: A,Y: A] :
( ( X3 != Y )
=> ( ~ ( ord_less @ A @ X3 @ Y )
=> ( ord_less @ A @ Y @ X3 ) ) ) ) ).
% neqE
thf(fact_50_neq__iff,axiom,
! [A: $tType] :
( ( linorder @ A )
=> ! [X3: A,Y: A] :
( ( X3 != Y )
= ( ( ord_less @ A @ X3 @ Y )
| ( ord_less @ A @ Y @ X3 ) ) ) ) ).
% neq_iff
thf(fact_51_order_Oasym,axiom,
! [A: $tType] :
( ( order @ A )
=> ! [A3: A,B4: A] :
( ( ord_less @ A @ A3 @ B4 )
=> ~ ( ord_less @ A @ B4 @ A3 ) ) ) ).
% order.asym
thf(fact_52_dense,axiom,
! [A: $tType] :
( ( dense_order @ A )
=> ! [X3: A,Y: A] :
( ( ord_less @ A @ X3 @ Y )
=> ? [Z: A] :
( ( ord_less @ A @ X3 @ Z )
& ( ord_less @ A @ Z @ Y ) ) ) ) ).
% dense
thf(fact_53_less__imp__neq,axiom,
! [A: $tType] :
( ( order @ A )
=> ! [X3: A,Y: A] :
( ( ord_less @ A @ X3 @ Y )
=> ( X3 != Y ) ) ) ).
% less_imp_neq
thf(fact_54_less__asym,axiom,
! [A: $tType] :
( ( preorder @ A )
=> ! [X3: A,Y: A] :
( ( ord_less @ A @ X3 @ Y )
=> ~ ( ord_less @ A @ Y @ X3 ) ) ) ).
% less_asym
thf(fact_55_less__asym_H,axiom,
! [A: $tType] :
( ( preorder @ A )
=> ! [A3: A,B4: A] :
( ( ord_less @ A @ A3 @ B4 )
=> ~ ( ord_less @ A @ B4 @ A3 ) ) ) ).
% less_asym'
thf(fact_56_less__trans,axiom,
! [A: $tType] :
( ( preorder @ A )
=> ! [X3: A,Y: A,Z3: A] :
( ( ord_less @ A @ X3 @ Y )
=> ( ( ord_less @ A @ Y @ Z3 )
=> ( ord_less @ A @ X3 @ Z3 ) ) ) ) ).
% less_trans
thf(fact_57_less__linear,axiom,
! [A: $tType] :
( ( linorder @ A )
=> ! [X3: A,Y: A] :
( ( ord_less @ A @ X3 @ Y )
| ( X3 = Y )
| ( ord_less @ A @ Y @ X3 ) ) ) ).
% less_linear
thf(fact_58_less__irrefl,axiom,
! [A: $tType] :
( ( preorder @ A )
=> ! [X3: A] :
~ ( ord_less @ A @ X3 @ X3 ) ) ).
% less_irrefl
thf(fact_59_ord__eq__less__trans,axiom,
! [A: $tType] :
( ( ord @ A )
=> ! [A3: A,B4: A,C2: A] :
( ( A3 = B4 )
=> ( ( ord_less @ A @ B4 @ C2 )
=> ( ord_less @ A @ A3 @ C2 ) ) ) ) ).
% ord_eq_less_trans
thf(fact_60_ord__less__eq__trans,axiom,
! [A: $tType] :
( ( ord @ A )
=> ! [A3: A,B4: A,C2: A] :
( ( ord_less @ A @ A3 @ B4 )
=> ( ( B4 = C2 )
=> ( ord_less @ A @ A3 @ C2 ) ) ) ) ).
% ord_less_eq_trans
thf(fact_61_dual__order_Oasym,axiom,
! [A: $tType] :
( ( order @ A )
=> ! [B4: A,A3: A] :
( ( ord_less @ A @ B4 @ A3 )
=> ~ ( ord_less @ A @ A3 @ B4 ) ) ) ).
% dual_order.asym
thf(fact_62_less__imp__not__eq,axiom,
! [A: $tType] :
( ( order @ A )
=> ! [X3: A,Y: A] :
( ( ord_less @ A @ X3 @ Y )
=> ( X3 != Y ) ) ) ).
% less_imp_not_eq
thf(fact_63_less__not__sym,axiom,
! [A: $tType] :
( ( preorder @ A )
=> ! [X3: A,Y: A] :
( ( ord_less @ A @ X3 @ Y )
=> ~ ( ord_less @ A @ Y @ X3 ) ) ) ).
% less_not_sym
thf(fact_64_less__induct,axiom,
! [A: $tType] :
( ( wellorder @ A )
=> ! [P: A > $o,A3: A] :
( ! [X2: A] :
( ! [Y3: A] :
( ( ord_less @ A @ Y3 @ X2 )
=> ( P @ Y3 ) )
=> ( P @ X2 ) )
=> ( P @ A3 ) ) ) ).
% less_induct
thf(fact_65_antisym__conv3,axiom,
! [A: $tType] :
( ( linorder @ A )
=> ! [Y: A,X3: A] :
( ~ ( ord_less @ A @ Y @ X3 )
=> ( ( ~ ( ord_less @ A @ X3 @ Y ) )
= ( X3 = Y ) ) ) ) ).
% antisym_conv3
thf(fact_66_less__imp__not__eq2,axiom,
! [A: $tType] :
( ( order @ A )
=> ! [X3: A,Y: A] :
( ( ord_less @ A @ X3 @ Y )
=> ( Y != X3 ) ) ) ).
% less_imp_not_eq2
thf(fact_67_less__imp__triv,axiom,
! [A: $tType] :
( ( preorder @ A )
=> ! [X3: A,Y: A,P: $o] :
( ( ord_less @ A @ X3 @ Y )
=> ( ( ord_less @ A @ Y @ X3 )
=> P ) ) ) ).
% less_imp_triv
thf(fact_68_linorder__cases,axiom,
! [A: $tType] :
( ( linorder @ A )
=> ! [X3: A,Y: A] :
( ~ ( ord_less @ A @ X3 @ Y )
=> ( ( X3 != Y )
=> ( ord_less @ A @ Y @ X3 ) ) ) ) ).
% linorder_cases
thf(fact_69_dual__order_Oirrefl,axiom,
! [A: $tType] :
( ( order @ A )
=> ! [A3: A] :
~ ( ord_less @ A @ A3 @ A3 ) ) ).
% dual_order.irrefl
thf(fact_70_order_Ostrict__trans,axiom,
! [A: $tType] :
( ( order @ A )
=> ! [A3: A,B4: A,C2: A] :
( ( ord_less @ A @ A3 @ B4 )
=> ( ( ord_less @ A @ B4 @ C2 )
=> ( ord_less @ A @ A3 @ C2 ) ) ) ) ).
% order.strict_trans
thf(fact_71_less__imp__not__less,axiom,
! [A: $tType] :
( ( preorder @ A )
=> ! [X3: A,Y: A] :
( ( ord_less @ A @ X3 @ Y )
=> ~ ( ord_less @ A @ Y @ X3 ) ) ) ).
% less_imp_not_less
thf(fact_72_exists__least__iff,axiom,
! [A: $tType] :
( ( wellorder @ A )
=> ( ( ^ [P3: A > $o] :
? [X5: A] : ( P3 @ X5 ) )
= ( ^ [P4: A > $o] :
? [N: A] :
( ( P4 @ N )
& ! [M: A] :
( ( ord_less @ A @ M @ N )
=> ~ ( P4 @ M ) ) ) ) ) ) ).
% exists_least_iff
thf(fact_73_linorder__less__wlog,axiom,
! [A: $tType] :
( ( linorder @ A )
=> ! [P: A > A > $o,A3: A,B4: A] :
( ! [A5: A,B3: A] :
( ( ord_less @ A @ A5 @ B3 )
=> ( P @ A5 @ B3 ) )
=> ( ! [A5: A] : ( P @ A5 @ A5 )
=> ( ! [A5: A,B3: A] :
( ( P @ B3 @ A5 )
=> ( P @ A5 @ B3 ) )
=> ( P @ A3 @ B4 ) ) ) ) ) ).
% linorder_less_wlog
thf(fact_74_dual__order_Ostrict__trans,axiom,
! [A: $tType] :
( ( order @ A )
=> ! [B4: A,A3: A,C2: A] :
( ( ord_less @ A @ B4 @ A3 )
=> ( ( ord_less @ A @ C2 @ B4 )
=> ( ord_less @ A @ C2 @ A3 ) ) ) ) ).
% dual_order.strict_trans
thf(fact_75_not__less__iff__gr__or__eq,axiom,
! [A: $tType] :
( ( linorder @ A )
=> ! [X3: A,Y: A] :
( ( ~ ( ord_less @ A @ X3 @ Y ) )
= ( ( ord_less @ A @ Y @ X3 )
| ( X3 = Y ) ) ) ) ).
% not_less_iff_gr_or_eq
thf(fact_76_binsert_Osimps_I1_J,axiom,
! [A: $tType,H: A > int,E: A] :
( ( binary1830089824insert @ A @ H @ E @ ( binary1746293266le_Tip @ A ) )
= ( binary210054475elle_T @ A @ ( binary1746293266le_Tip @ A ) @ E @ ( binary1746293266le_Tip @ A ) ) ) ).
% binsert.simps(1)
thf(fact_77_verit__comp__simplify1_I1_J,axiom,
! [A: $tType] :
( ( order @ A )
=> ! [A3: A] :
~ ( ord_less @ A @ A3 @ A3 ) ) ).
% verit_comp_simplify1(1)
thf(fact_78_measure__induct,axiom,
! [B: $tType,A: $tType] :
( ( wellorder @ B )
=> ! [F3: A > B,P: A > $o,A3: A] :
( ! [X2: A] :
( ! [Y3: A] :
( ( ord_less @ B @ ( F3 @ Y3 ) @ ( F3 @ X2 ) )
=> ( P @ Y3 ) )
=> ( P @ X2 ) )
=> ( P @ A3 ) ) ) ).
% measure_induct
thf(fact_79_measure__induct__rule,axiom,
! [B: $tType,A: $tType] :
( ( wellorder @ B )
=> ! [F3: A > B,P: A > $o,A3: A] :
( ! [X2: A] :
( ! [Y3: A] :
( ( ord_less @ B @ ( F3 @ Y3 ) @ ( F3 @ X2 ) )
=> ( P @ Y3 ) )
=> ( P @ X2 ) )
=> ( P @ A3 ) ) ) ).
% measure_induct_rule
thf(fact_80_c2,axiom,
( ( binary1653327646_setOf @ a @ ( binary1830089824insert @ a @ h @ e @ t2 ) )
= ( sup_sup @ ( set @ a ) @ ( minus_minus @ ( set @ a ) @ ( binary1653327646_setOf @ a @ t2 ) @ ( binary64540844le_eqs @ a @ h @ e ) ) @ ( insert @ a @ e @ ( bot_bot @ ( set @ a ) ) ) ) ) ).
% c2
thf(fact_81_Tree_Osimps_I5_J,axiom,
! [B: $tType,A: $tType,F1: B,F22: ( binary1291135688e_Tree @ A ) > A > ( binary1291135688e_Tree @ A ) > B,X21: binary1291135688e_Tree @ A,X22: A,X23: binary1291135688e_Tree @ A] :
( ( binary536355927e_Tree @ B @ A @ F1 @ F22 @ ( binary210054475elle_T @ A @ X21 @ X22 @ X23 ) )
= ( F22 @ X21 @ X22 @ X23 ) ) ).
% Tree.simps(5)
thf(fact_82_c1,axiom,
( ( binary1653327646_setOf @ a @ ( binary1830089824insert @ a @ h @ e @ t1 ) )
= ( sup_sup @ ( set @ a ) @ ( minus_minus @ ( set @ a ) @ ( binary1653327646_setOf @ a @ t1 ) @ ( binary64540844le_eqs @ a @ h @ e ) ) @ ( insert @ a @ e @ ( bot_bot @ ( set @ a ) ) ) ) ) ).
% c1
thf(fact_83_Tree_Osimps_I7_J,axiom,
! [C: $tType,A: $tType,F1: C,F22: ( binary1291135688e_Tree @ A ) > A > ( binary1291135688e_Tree @ A ) > C > C > C,X21: binary1291135688e_Tree @ A,X22: A,X23: binary1291135688e_Tree @ A] :
( ( binary1929596613c_Tree @ C @ A @ F1 @ F22 @ ( binary210054475elle_T @ A @ X21 @ X22 @ X23 ) )
= ( F22 @ X21 @ X22 @ X23 @ ( binary1929596613c_Tree @ C @ A @ F1 @ F22 @ X21 ) @ ( binary1929596613c_Tree @ C @ A @ F1 @ F22 @ X23 ) ) ) ).
% Tree.simps(7)
thf(fact_84_Tree_Opred__inject_I2_J,axiom,
! [A: $tType,P: A > $o,A3: binary1291135688e_Tree @ A,Aa: A,Ab: binary1291135688e_Tree @ A] :
( ( binary1693644968d_Tree @ A @ P @ ( binary210054475elle_T @ A @ A3 @ Aa @ Ab ) )
= ( ( binary1693644968d_Tree @ A @ P @ A3 )
& ( P @ Aa )
& ( binary1693644968d_Tree @ A @ P @ Ab ) ) ) ).
% Tree.pred_inject(2)
thf(fact_85_bot__apply,axiom,
! [C: $tType,D: $tType] :
( ( bot @ C )
=> ( ( bot_bot @ ( D > C ) )
= ( ^ [X4: D] : ( bot_bot @ C ) ) ) ) ).
% bot_apply
thf(fact_86_bot__fun__def,axiom,
! [B: $tType,A: $tType] :
( ( bot @ B )
=> ( ( bot_bot @ ( A > B ) )
= ( ^ [X4: A] : ( bot_bot @ B ) ) ) ) ).
% bot_fun_def
thf(fact_87_Tree_Osimps_I6_J,axiom,
! [A: $tType,C: $tType,F1: C,F22: ( binary1291135688e_Tree @ A ) > A > ( binary1291135688e_Tree @ A ) > C > C > C] :
( ( binary1929596613c_Tree @ C @ A @ F1 @ F22 @ ( binary1746293266le_Tip @ A ) )
= F1 ) ).
% Tree.simps(6)
thf(fact_88_Tree_Osimps_I4_J,axiom,
! [A: $tType,B: $tType,F1: B,F22: ( binary1291135688e_Tree @ A ) > A > ( binary1291135688e_Tree @ A ) > B] :
( ( binary536355927e_Tree @ B @ A @ F1 @ F22 @ ( binary1746293266le_Tip @ A ) )
= F1 ) ).
% Tree.simps(4)
thf(fact_89_Tree_Opred__inject_I1_J,axiom,
! [A: $tType,P: A > $o] : ( binary1693644968d_Tree @ A @ P @ ( binary1746293266le_Tip @ A ) ) ).
% Tree.pred_inject(1)
thf(fact_90_setOf_Osimps_I2_J,axiom,
! [A: $tType,T1: binary1291135688e_Tree @ A,X3: A,T2: binary1291135688e_Tree @ A] :
( ( binary1653327646_setOf @ A @ ( binary210054475elle_T @ A @ T1 @ X3 @ T2 ) )
= ( sup_sup @ ( set @ A ) @ ( sup_sup @ ( set @ A ) @ ( binary1653327646_setOf @ A @ T1 ) @ ( binary1653327646_setOf @ A @ T2 ) ) @ ( insert @ A @ X3 @ ( bot_bot @ ( set @ A ) ) ) ) ) ).
% setOf.simps(2)
thf(fact_91_setOf_Osimps_I1_J,axiom,
! [A: $tType] :
( ( binary1653327646_setOf @ A @ ( binary1746293266le_Tip @ A ) )
= ( bot_bot @ ( set @ A ) ) ) ).
% setOf.simps(1)
thf(fact_92_bot_Onot__eq__extremum,axiom,
! [A: $tType] :
( ( order_bot @ A )
=> ! [A3: A] :
( ( A3
!= ( bot_bot @ A ) )
= ( ord_less @ A @ ( bot_bot @ A ) @ A3 ) ) ) ).
% bot.not_eq_extremum
thf(fact_93_bot_Oextremum__strict,axiom,
! [A: $tType] :
( ( order_bot @ A )
=> ! [A3: A] :
~ ( ord_less @ A @ A3 @ ( bot_bot @ A ) ) ) ).
% bot.extremum_strict
thf(fact_94_Tree_Odistinct_I1_J,axiom,
! [A: $tType,X21: binary1291135688e_Tree @ A,X22: A,X23: binary1291135688e_Tree @ A] :
( ( binary1746293266le_Tip @ A )
!= ( binary210054475elle_T @ A @ X21 @ X22 @ X23 ) ) ).
% Tree.distinct(1)
thf(fact_95_Tree_Oinduct,axiom,
! [A: $tType,P: ( binary1291135688e_Tree @ A ) > $o,Tree: binary1291135688e_Tree @ A] :
( ( P @ ( binary1746293266le_Tip @ A ) )
=> ( ! [X1: binary1291135688e_Tree @ A,X24: A,X32: binary1291135688e_Tree @ A] :
( ( P @ X1 )
=> ( ( P @ X32 )
=> ( P @ ( binary210054475elle_T @ A @ X1 @ X24 @ X32 ) ) ) )
=> ( P @ Tree ) ) ) ).
% Tree.induct
thf(fact_96_Tree_Oexhaust,axiom,
! [A: $tType,Y: binary1291135688e_Tree @ A] :
( ( Y
!= ( binary1746293266le_Tip @ A ) )
=> ~ ! [X212: binary1291135688e_Tree @ A,X222: A,X232: binary1291135688e_Tree @ A] :
( Y
!= ( binary210054475elle_T @ A @ X212 @ X222 @ X232 ) ) ) ).
% Tree.exhaust
thf(fact_97_sortedTree_Osimps_I1_J,axiom,
! [A: $tType,H: A > int] : ( binary1610619414edTree @ A @ H @ ( binary1746293266le_Tip @ A ) ) ).
% sortedTree.simps(1)
thf(fact_98_insert__Diff__single,axiom,
! [A: $tType,A3: A,A4: set @ A] :
( ( insert @ A @ A3 @ ( minus_minus @ ( set @ A ) @ A4 @ ( insert @ A @ A3 @ ( bot_bot @ ( set @ A ) ) ) ) )
= ( insert @ A @ A3 @ A4 ) ) ).
% insert_Diff_single
thf(fact_99_Un__Diff__cancel,axiom,
! [A: $tType,A4: set @ A,B5: set @ A] :
( ( sup_sup @ ( set @ A ) @ A4 @ ( minus_minus @ ( set @ A ) @ B5 @ A4 ) )
= ( sup_sup @ ( set @ A ) @ A4 @ B5 ) ) ).
% Un_Diff_cancel
thf(fact_100_Un__Diff__cancel2,axiom,
! [A: $tType,B5: set @ A,A4: set @ A] :
( ( sup_sup @ ( set @ A ) @ ( minus_minus @ ( set @ A ) @ B5 @ A4 ) @ A4 )
= ( sup_sup @ ( set @ A ) @ B5 @ A4 ) ) ).
% Un_Diff_cancel2
thf(fact_101_Diff__insert0,axiom,
! [A: $tType,X3: A,A4: set @ A,B5: set @ A] :
( ~ ( member @ A @ X3 @ A4 )
=> ( ( minus_minus @ ( set @ A ) @ A4 @ ( insert @ A @ X3 @ B5 ) )
= ( minus_minus @ ( set @ A ) @ A4 @ B5 ) ) ) ).
% Diff_insert0
thf(fact_102_insert__Diff1,axiom,
! [A: $tType,X3: A,B5: set @ A,A4: set @ A] :
( ( member @ A @ X3 @ B5 )
=> ( ( minus_minus @ ( set @ A ) @ ( insert @ A @ X3 @ A4 ) @ B5 )
= ( minus_minus @ ( set @ A ) @ A4 @ B5 ) ) ) ).
% insert_Diff1
thf(fact_103_Un__insert__left,axiom,
! [A: $tType,A3: A,B5: set @ A,C3: set @ A] :
( ( sup_sup @ ( set @ A ) @ ( insert @ A @ A3 @ B5 ) @ C3 )
= ( insert @ A @ A3 @ ( sup_sup @ ( set @ A ) @ B5 @ C3 ) ) ) ).
% Un_insert_left
thf(fact_104_empty__Collect__eq,axiom,
! [A: $tType,P: A > $o] :
( ( ( bot_bot @ ( set @ A ) )
= ( collect @ A @ P ) )
= ( ! [X4: A] :
~ ( P @ X4 ) ) ) ).
% empty_Collect_eq
thf(fact_105_Collect__empty__eq,axiom,
! [A: $tType,P: A > $o] :
( ( ( collect @ A @ P )
= ( bot_bot @ ( set @ A ) ) )
= ( ! [X4: A] :
~ ( P @ X4 ) ) ) ).
% Collect_empty_eq
thf(fact_106_all__not__in__conv,axiom,
! [A: $tType,A4: set @ A] :
( ( ! [X4: A] :
~ ( member @ A @ X4 @ A4 ) )
= ( A4
= ( bot_bot @ ( set @ A ) ) ) ) ).
% all_not_in_conv
thf(fact_107_empty__iff,axiom,
! [A: $tType,C2: A] :
~ ( member @ A @ C2 @ ( bot_bot @ ( set @ A ) ) ) ).
% empty_iff
thf(fact_108_insert__absorb2,axiom,
! [A: $tType,X3: A,A4: set @ A] :
( ( insert @ A @ X3 @ ( insert @ A @ X3 @ A4 ) )
= ( insert @ A @ X3 @ A4 ) ) ).
% insert_absorb2
thf(fact_109_insert__iff,axiom,
! [A: $tType,A3: A,B4: A,A4: set @ A] :
( ( member @ A @ A3 @ ( insert @ A @ B4 @ A4 ) )
= ( ( A3 = B4 )
| ( member @ A @ A3 @ A4 ) ) ) ).
% insert_iff
thf(fact_110_insertCI,axiom,
! [A: $tType,A3: A,B5: set @ A,B4: A] :
( ( ~ ( member @ A @ A3 @ B5 )
=> ( A3 = B4 ) )
=> ( member @ A @ A3 @ ( insert @ A @ B4 @ B5 ) ) ) ).
% insertCI
thf(fact_111_Un__iff,axiom,
! [A: $tType,C2: A,A4: set @ A,B5: set @ A] :
( ( member @ A @ C2 @ ( sup_sup @ ( set @ A ) @ A4 @ B5 ) )
= ( ( member @ A @ C2 @ A4 )
| ( member @ A @ C2 @ B5 ) ) ) ).
% Un_iff
thf(fact_112_UnCI,axiom,
! [A: $tType,C2: A,B5: set @ A,A4: set @ A] :
( ( ~ ( member @ A @ C2 @ B5 )
=> ( member @ A @ C2 @ A4 ) )
=> ( member @ A @ C2 @ ( sup_sup @ ( set @ A ) @ A4 @ B5 ) ) ) ).
% UnCI
thf(fact_113_Diff__idemp,axiom,
! [A: $tType,A4: set @ A,B5: set @ A] :
( ( minus_minus @ ( set @ A ) @ ( minus_minus @ ( set @ A ) @ A4 @ B5 ) @ B5 )
= ( minus_minus @ ( set @ A ) @ A4 @ B5 ) ) ).
% Diff_idemp
thf(fact_114_Diff__iff,axiom,
! [A: $tType,C2: A,A4: set @ A,B5: set @ A] :
( ( member @ A @ C2 @ ( minus_minus @ ( set @ A ) @ A4 @ B5 ) )
= ( ( member @ A @ C2 @ A4 )
& ~ ( member @ A @ C2 @ B5 ) ) ) ).
% Diff_iff
thf(fact_115_DiffI,axiom,
! [A: $tType,C2: A,A4: set @ A,B5: set @ A] :
( ( member @ A @ C2 @ A4 )
=> ( ~ ( member @ A @ C2 @ B5 )
=> ( member @ A @ C2 @ ( minus_minus @ ( set @ A ) @ A4 @ B5 ) ) ) ) ).
% DiffI
thf(fact_116_singletonI,axiom,
! [A: $tType,A3: A] : ( member @ A @ A3 @ ( insert @ A @ A3 @ ( bot_bot @ ( set @ A ) ) ) ) ).
% singletonI
thf(fact_117_Un__empty,axiom,
! [A: $tType,A4: set @ A,B5: set @ A] :
( ( ( sup_sup @ ( set @ A ) @ A4 @ B5 )
= ( bot_bot @ ( set @ A ) ) )
= ( ( A4
= ( bot_bot @ ( set @ A ) ) )
& ( B5
= ( bot_bot @ ( set @ A ) ) ) ) ) ).
% Un_empty
thf(fact_118_Diff__cancel,axiom,
! [A: $tType,A4: set @ A] :
( ( minus_minus @ ( set @ A ) @ A4 @ A4 )
= ( bot_bot @ ( set @ A ) ) ) ).
% Diff_cancel
thf(fact_119_empty__Diff,axiom,
! [A: $tType,A4: set @ A] :
( ( minus_minus @ ( set @ A ) @ ( bot_bot @ ( set @ A ) ) @ A4 )
= ( bot_bot @ ( set @ A ) ) ) ).
% empty_Diff
thf(fact_120_Diff__empty,axiom,
! [A: $tType,A4: set @ A] :
( ( minus_minus @ ( set @ A ) @ A4 @ ( bot_bot @ ( set @ A ) ) )
= A4 ) ).
% Diff_empty
thf(fact_121_Un__insert__right,axiom,
! [A: $tType,A4: set @ A,A3: A,B5: set @ A] :
( ( sup_sup @ ( set @ A ) @ A4 @ ( insert @ A @ A3 @ B5 ) )
= ( insert @ A @ A3 @ ( sup_sup @ ( set @ A ) @ A4 @ B5 ) ) ) ).
% Un_insert_right
thf(fact_122_bot__set__def,axiom,
! [A: $tType] :
( ( bot_bot @ ( set @ A ) )
= ( collect @ A @ ( bot_bot @ ( A > $o ) ) ) ) ).
% bot_set_def
thf(fact_123_not__psubset__empty,axiom,
! [A: $tType,A4: set @ A] :
~ ( ord_less @ ( set @ A ) @ A4 @ ( bot_bot @ ( set @ A ) ) ) ).
% not_psubset_empty
thf(fact_124_ex__in__conv,axiom,
! [A: $tType,A4: set @ A] :
( ( ? [X4: A] : ( member @ A @ X4 @ A4 ) )
= ( A4
!= ( bot_bot @ ( set @ A ) ) ) ) ).
% ex_in_conv
thf(fact_125_equals0I,axiom,
! [A: $tType,A4: set @ A] :
( ! [Y2: A] :
~ ( member @ A @ Y2 @ A4 )
=> ( A4
= ( bot_bot @ ( set @ A ) ) ) ) ).
% equals0I
thf(fact_126_equals0D,axiom,
! [A: $tType,A4: set @ A,A3: A] :
( ( A4
= ( bot_bot @ ( set @ A ) ) )
=> ~ ( member @ A @ A3 @ A4 ) ) ).
% equals0D
thf(fact_127_emptyE,axiom,
! [A: $tType,A3: A] :
~ ( member @ A @ A3 @ ( bot_bot @ ( set @ A ) ) ) ).
% emptyE
thf(fact_128_mk__disjoint__insert,axiom,
! [A: $tType,A3: A,A4: set @ A] :
( ( member @ A @ A3 @ A4 )
=> ? [B6: set @ A] :
( ( A4
= ( insert @ A @ A3 @ B6 ) )
& ~ ( member @ A @ A3 @ B6 ) ) ) ).
% mk_disjoint_insert
thf(fact_129_insert__commute,axiom,
! [A: $tType,X3: A,Y: A,A4: set @ A] :
( ( insert @ A @ X3 @ ( insert @ A @ Y @ A4 ) )
= ( insert @ A @ Y @ ( insert @ A @ X3 @ A4 ) ) ) ).
% insert_commute
thf(fact_130_insert__eq__iff,axiom,
! [A: $tType,A3: A,A4: set @ A,B4: A,B5: set @ A] :
( ~ ( member @ A @ A3 @ A4 )
=> ( ~ ( member @ A @ B4 @ B5 )
=> ( ( ( insert @ A @ A3 @ A4 )
= ( insert @ A @ B4 @ B5 ) )
= ( ( ( A3 = B4 )
=> ( A4 = B5 ) )
& ( ( A3 != B4 )
=> ? [C4: set @ A] :
( ( A4
= ( insert @ A @ B4 @ C4 ) )
& ~ ( member @ A @ B4 @ C4 )
& ( B5
= ( insert @ A @ A3 @ C4 ) )
& ~ ( member @ A @ A3 @ C4 ) ) ) ) ) ) ) ).
% insert_eq_iff
thf(fact_131_insert__absorb,axiom,
! [A: $tType,A3: A,A4: set @ A] :
( ( member @ A @ A3 @ A4 )
=> ( ( insert @ A @ A3 @ A4 )
= A4 ) ) ).
% insert_absorb
thf(fact_132_insert__ident,axiom,
! [A: $tType,X3: A,A4: set @ A,B5: set @ A] :
( ~ ( member @ A @ X3 @ A4 )
=> ( ~ ( member @ A @ X3 @ B5 )
=> ( ( ( insert @ A @ X3 @ A4 )
= ( insert @ A @ X3 @ B5 ) )
= ( A4 = B5 ) ) ) ) ).
% insert_ident
thf(fact_133_Set_Oset__insert,axiom,
! [A: $tType,X3: A,A4: set @ A] :
( ( member @ A @ X3 @ A4 )
=> ~ ! [B6: set @ A] :
( ( A4
= ( insert @ A @ X3 @ B6 ) )
=> ( member @ A @ X3 @ B6 ) ) ) ).
% Set.set_insert
thf(fact_134_insertI2,axiom,
! [A: $tType,A3: A,B5: set @ A,B4: A] :
( ( member @ A @ A3 @ B5 )
=> ( member @ A @ A3 @ ( insert @ A @ B4 @ B5 ) ) ) ).
% insertI2
thf(fact_135_insertI1,axiom,
! [A: $tType,A3: A,B5: set @ A] : ( member @ A @ A3 @ ( insert @ A @ A3 @ B5 ) ) ).
% insertI1
thf(fact_136_insertE,axiom,
! [A: $tType,A3: A,B4: A,A4: set @ A] :
( ( member @ A @ A3 @ ( insert @ A @ B4 @ A4 ) )
=> ( ( A3 != B4 )
=> ( member @ A @ A3 @ A4 ) ) ) ).
% insertE
thf(fact_137_Un__left__commute,axiom,
! [A: $tType,A4: set @ A,B5: set @ A,C3: set @ A] :
( ( sup_sup @ ( set @ A ) @ A4 @ ( sup_sup @ ( set @ A ) @ B5 @ C3 ) )
= ( sup_sup @ ( set @ A ) @ B5 @ ( sup_sup @ ( set @ A ) @ A4 @ C3 ) ) ) ).
% Un_left_commute
thf(fact_138_Un__left__absorb,axiom,
! [A: $tType,A4: set @ A,B5: set @ A] :
( ( sup_sup @ ( set @ A ) @ A4 @ ( sup_sup @ ( set @ A ) @ A4 @ B5 ) )
= ( sup_sup @ ( set @ A ) @ A4 @ B5 ) ) ).
% Un_left_absorb
thf(fact_139_Un__commute,axiom,
! [A: $tType] :
( ( sup_sup @ ( set @ A ) )
= ( ^ [A6: set @ A,B7: set @ A] : ( sup_sup @ ( set @ A ) @ B7 @ A6 ) ) ) ).
% Un_commute
thf(fact_140_Un__absorb,axiom,
! [A: $tType,A4: set @ A] :
( ( sup_sup @ ( set @ A ) @ A4 @ A4 )
= A4 ) ).
% Un_absorb
thf(fact_141_Un__assoc,axiom,
! [A: $tType,A4: set @ A,B5: set @ A,C3: set @ A] :
( ( sup_sup @ ( set @ A ) @ ( sup_sup @ ( set @ A ) @ A4 @ B5 ) @ C3 )
= ( sup_sup @ ( set @ A ) @ A4 @ ( sup_sup @ ( set @ A ) @ B5 @ C3 ) ) ) ).
% Un_assoc
thf(fact_142_ball__Un,axiom,
! [A: $tType,A4: set @ A,B5: set @ A,P: A > $o] :
( ( ! [X4: A] :
( ( member @ A @ X4 @ ( sup_sup @ ( set @ A ) @ A4 @ B5 ) )
=> ( P @ X4 ) ) )
= ( ! [X4: A] :
( ( member @ A @ X4 @ A4 )
=> ( P @ X4 ) )
& ! [X4: A] :
( ( member @ A @ X4 @ B5 )
=> ( P @ X4 ) ) ) ) ).
% ball_Un
thf(fact_143_bex__Un,axiom,
! [A: $tType,A4: set @ A,B5: set @ A,P: A > $o] :
( ( ? [X4: A] :
( ( member @ A @ X4 @ ( sup_sup @ ( set @ A ) @ A4 @ B5 ) )
& ( P @ X4 ) ) )
= ( ? [X4: A] :
( ( member @ A @ X4 @ A4 )
& ( P @ X4 ) )
| ? [X4: A] :
( ( member @ A @ X4 @ B5 )
& ( P @ X4 ) ) ) ) ).
% bex_Un
thf(fact_144_UnI2,axiom,
! [A: $tType,C2: A,B5: set @ A,A4: set @ A] :
( ( member @ A @ C2 @ B5 )
=> ( member @ A @ C2 @ ( sup_sup @ ( set @ A ) @ A4 @ B5 ) ) ) ).
% UnI2
thf(fact_145_UnI1,axiom,
! [A: $tType,C2: A,A4: set @ A,B5: set @ A] :
( ( member @ A @ C2 @ A4 )
=> ( member @ A @ C2 @ ( sup_sup @ ( set @ A ) @ A4 @ B5 ) ) ) ).
% UnI1
thf(fact_146_UnE,axiom,
! [A: $tType,C2: A,A4: set @ A,B5: set @ A] :
( ( member @ A @ C2 @ ( sup_sup @ ( set @ A ) @ A4 @ B5 ) )
=> ( ~ ( member @ A @ C2 @ A4 )
=> ( member @ A @ C2 @ B5 ) ) ) ).
% UnE
thf(fact_147_psubset__imp__ex__mem,axiom,
! [A: $tType,A4: set @ A,B5: set @ A] :
( ( ord_less @ ( set @ A ) @ A4 @ B5 )
=> ? [B3: A] : ( member @ A @ B3 @ ( minus_minus @ ( set @ A ) @ B5 @ A4 ) ) ) ).
% psubset_imp_ex_mem
thf(fact_148_DiffD2,axiom,
! [A: $tType,C2: A,A4: set @ A,B5: set @ A] :
( ( member @ A @ C2 @ ( minus_minus @ ( set @ A ) @ A4 @ B5 ) )
=> ~ ( member @ A @ C2 @ B5 ) ) ).
% DiffD2
thf(fact_149_DiffD1,axiom,
! [A: $tType,C2: A,A4: set @ A,B5: set @ A] :
( ( member @ A @ C2 @ ( minus_minus @ ( set @ A ) @ A4 @ B5 ) )
=> ( member @ A @ C2 @ A4 ) ) ).
% DiffD1
thf(fact_150_DiffE,axiom,
! [A: $tType,C2: A,A4: set @ A,B5: set @ A] :
( ( member @ A @ C2 @ ( minus_minus @ ( set @ A ) @ A4 @ B5 ) )
=> ~ ( ( member @ A @ C2 @ A4 )
=> ( member @ A @ C2 @ B5 ) ) ) ).
% DiffE
thf(fact_151_singleton__inject,axiom,
! [A: $tType,A3: A,B4: A] :
( ( ( insert @ A @ A3 @ ( bot_bot @ ( set @ A ) ) )
= ( insert @ A @ B4 @ ( bot_bot @ ( set @ A ) ) ) )
=> ( A3 = B4 ) ) ).
% singleton_inject
thf(fact_152_insert__not__empty,axiom,
! [A: $tType,A3: A,A4: set @ A] :
( ( insert @ A @ A3 @ A4 )
!= ( bot_bot @ ( set @ A ) ) ) ).
% insert_not_empty
thf(fact_153_doubleton__eq__iff,axiom,
! [A: $tType,A3: A,B4: A,C2: A,D2: A] :
( ( ( insert @ A @ A3 @ ( insert @ A @ B4 @ ( bot_bot @ ( set @ A ) ) ) )
= ( insert @ A @ C2 @ ( insert @ A @ D2 @ ( bot_bot @ ( set @ A ) ) ) ) )
= ( ( ( A3 = C2 )
& ( B4 = D2 ) )
| ( ( A3 = D2 )
& ( B4 = C2 ) ) ) ) ).
% doubleton_eq_iff
thf(fact_154_singleton__iff,axiom,
! [A: $tType,B4: A,A3: A] :
( ( member @ A @ B4 @ ( insert @ A @ A3 @ ( bot_bot @ ( set @ A ) ) ) )
= ( B4 = A3 ) ) ).
% singleton_iff
thf(fact_155_singletonD,axiom,
! [A: $tType,B4: A,A3: A] :
( ( member @ A @ B4 @ ( insert @ A @ A3 @ ( bot_bot @ ( set @ A ) ) ) )
=> ( B4 = A3 ) ) ).
% singletonD
thf(fact_156_Un__empty__right,axiom,
! [A: $tType,A4: set @ A] :
( ( sup_sup @ ( set @ A ) @ A4 @ ( bot_bot @ ( set @ A ) ) )
= A4 ) ).
% Un_empty_right
thf(fact_157_Un__empty__left,axiom,
! [A: $tType,B5: set @ A] :
( ( sup_sup @ ( set @ A ) @ ( bot_bot @ ( set @ A ) ) @ B5 )
= B5 ) ).
% Un_empty_left
thf(fact_158_insert__Diff__if,axiom,
! [A: $tType,X3: A,B5: set @ A,A4: set @ A] :
( ( ( member @ A @ X3 @ B5 )
=> ( ( minus_minus @ ( set @ A ) @ ( insert @ A @ X3 @ A4 ) @ B5 )
= ( minus_minus @ ( set @ A ) @ A4 @ B5 ) ) )
& ( ~ ( member @ A @ X3 @ B5 )
=> ( ( minus_minus @ ( set @ A ) @ ( insert @ A @ X3 @ A4 ) @ B5 )
= ( insert @ A @ X3 @ ( minus_minus @ ( set @ A ) @ A4 @ B5 ) ) ) ) ) ).
% insert_Diff_if
thf(fact_159_Un__Diff,axiom,
! [A: $tType,A4: set @ A,B5: set @ A,C3: set @ A] :
( ( minus_minus @ ( set @ A ) @ ( sup_sup @ ( set @ A ) @ A4 @ B5 ) @ C3 )
= ( sup_sup @ ( set @ A ) @ ( minus_minus @ ( set @ A ) @ A4 @ C3 ) @ ( minus_minus @ ( set @ A ) @ B5 @ C3 ) ) ) ).
% Un_Diff
thf(fact_160_singleton__Un__iff,axiom,
! [A: $tType,X3: A,A4: set @ A,B5: set @ A] :
( ( ( insert @ A @ X3 @ ( bot_bot @ ( set @ A ) ) )
= ( sup_sup @ ( set @ A ) @ A4 @ B5 ) )
= ( ( ( A4
= ( bot_bot @ ( set @ A ) ) )
& ( B5
= ( insert @ A @ X3 @ ( bot_bot @ ( set @ A ) ) ) ) )
| ( ( A4
= ( insert @ A @ X3 @ ( bot_bot @ ( set @ A ) ) ) )
& ( B5
= ( bot_bot @ ( set @ A ) ) ) )
| ( ( A4
= ( insert @ A @ X3 @ ( bot_bot @ ( set @ A ) ) ) )
& ( B5
= ( insert @ A @ X3 @ ( bot_bot @ ( set @ A ) ) ) ) ) ) ) ).
% singleton_Un_iff
thf(fact_161_Un__singleton__iff,axiom,
! [A: $tType,A4: set @ A,B5: set @ A,X3: A] :
( ( ( sup_sup @ ( set @ A ) @ A4 @ B5 )
= ( insert @ A @ X3 @ ( bot_bot @ ( set @ A ) ) ) )
= ( ( ( A4
= ( bot_bot @ ( set @ A ) ) )
& ( B5
= ( insert @ A @ X3 @ ( bot_bot @ ( set @ A ) ) ) ) )
| ( ( A4
= ( insert @ A @ X3 @ ( bot_bot @ ( set @ A ) ) ) )
& ( B5
= ( bot_bot @ ( set @ A ) ) ) )
| ( ( A4
= ( insert @ A @ X3 @ ( bot_bot @ ( set @ A ) ) ) )
& ( B5
= ( insert @ A @ X3 @ ( bot_bot @ ( set @ A ) ) ) ) ) ) ) ).
% Un_singleton_iff
thf(fact_162_insert__is__Un,axiom,
! [A: $tType] :
( ( insert @ A )
= ( ^ [A2: A] : ( sup_sup @ ( set @ A ) @ ( insert @ A @ A2 @ ( bot_bot @ ( set @ A ) ) ) ) ) ) ).
% insert_is_Un
thf(fact_163_Diff__insert__absorb,axiom,
! [A: $tType,X3: A,A4: set @ A] :
( ~ ( member @ A @ X3 @ A4 )
=> ( ( minus_minus @ ( set @ A ) @ ( insert @ A @ X3 @ A4 ) @ ( insert @ A @ X3 @ ( bot_bot @ ( set @ A ) ) ) )
= A4 ) ) ).
% Diff_insert_absorb
thf(fact_164_Diff__insert2,axiom,
! [A: $tType,A4: set @ A,A3: A,B5: set @ A] :
( ( minus_minus @ ( set @ A ) @ A4 @ ( insert @ A @ A3 @ B5 ) )
= ( minus_minus @ ( set @ A ) @ ( minus_minus @ ( set @ A ) @ A4 @ ( insert @ A @ A3 @ ( bot_bot @ ( set @ A ) ) ) ) @ B5 ) ) ).
% Diff_insert2
thf(fact_165_insert__Diff,axiom,
! [A: $tType,A3: A,A4: set @ A] :
( ( member @ A @ A3 @ A4 )
=> ( ( insert @ A @ A3 @ ( minus_minus @ ( set @ A ) @ A4 @ ( insert @ A @ A3 @ ( bot_bot @ ( set @ A ) ) ) ) )
= A4 ) ) ).
% insert_Diff
thf(fact_166_Diff__insert,axiom,
! [A: $tType,A4: set @ A,A3: A,B5: set @ A] :
( ( minus_minus @ ( set @ A ) @ A4 @ ( insert @ A @ A3 @ B5 ) )
= ( minus_minus @ ( set @ A ) @ ( minus_minus @ ( set @ A ) @ A4 @ B5 ) @ ( insert @ A @ A3 @ ( bot_bot @ ( set @ A ) ) ) ) ) ).
% Diff_insert
thf(fact_167_sup__bot_Oright__neutral,axiom,
! [A: $tType] :
( ( bounde1808546759up_bot @ A )
=> ! [A3: A] :
( ( sup_sup @ A @ A3 @ ( bot_bot @ A ) )
= A3 ) ) ).
% sup_bot.right_neutral
thf(fact_168_sup__bot_Oneutr__eq__iff,axiom,
! [A: $tType] :
( ( bounde1808546759up_bot @ A )
=> ! [A3: A,B4: A] :
( ( ( bot_bot @ A )
= ( sup_sup @ A @ A3 @ B4 ) )
= ( ( A3
= ( bot_bot @ A ) )
& ( B4
= ( bot_bot @ A ) ) ) ) ) ).
% sup_bot.neutr_eq_iff
thf(fact_169_sup__bot_Oleft__neutral,axiom,
! [A: $tType] :
( ( bounde1808546759up_bot @ A )
=> ! [A3: A] :
( ( sup_sup @ A @ ( bot_bot @ A ) @ A3 )
= A3 ) ) ).
% sup_bot.left_neutral
thf(fact_170_sup__bot_Oeq__neutr__iff,axiom,
! [A: $tType] :
( ( bounde1808546759up_bot @ A )
=> ! [A3: A,B4: A] :
( ( ( sup_sup @ A @ A3 @ B4 )
= ( bot_bot @ A ) )
= ( ( A3
= ( bot_bot @ A ) )
& ( B4
= ( bot_bot @ A ) ) ) ) ) ).
% sup_bot.eq_neutr_iff
thf(fact_171_sup__eq__bot__iff,axiom,
! [A: $tType] :
( ( bounde1808546759up_bot @ A )
=> ! [X3: A,Y: A] :
( ( ( sup_sup @ A @ X3 @ Y )
= ( bot_bot @ A ) )
= ( ( X3
= ( bot_bot @ A ) )
& ( Y
= ( bot_bot @ A ) ) ) ) ) ).
% sup_eq_bot_iff
thf(fact_172_minus__apply,axiom,
! [B: $tType,A: $tType] :
( ( minus @ B )
=> ( ( minus_minus @ ( A > B ) )
= ( ^ [A6: A > B,B7: A > B,X4: A] : ( minus_minus @ B @ ( A6 @ X4 ) @ ( B7 @ X4 ) ) ) ) ) ).
% minus_apply
thf(fact_173_sup__apply,axiom,
! [B: $tType,A: $tType] :
( ( semilattice_sup @ B )
=> ( ( sup_sup @ ( A > B ) )
= ( ^ [F4: A > B,G3: A > B,X4: A] : ( sup_sup @ B @ ( F4 @ X4 ) @ ( G3 @ X4 ) ) ) ) ) ).
% sup_apply
thf(fact_174_sup_Oidem,axiom,
! [A: $tType] :
( ( semilattice_sup @ A )
=> ! [A3: A] :
( ( sup_sup @ A @ A3 @ A3 )
= A3 ) ) ).
% sup.idem
thf(fact_175_sup__idem,axiom,
! [A: $tType] :
( ( semilattice_sup @ A )
=> ! [X3: A] :
( ( sup_sup @ A @ X3 @ X3 )
= X3 ) ) ).
% sup_idem
thf(fact_176_sup_Oleft__idem,axiom,
! [A: $tType] :
( ( semilattice_sup @ A )
=> ! [A3: A,B4: A] :
( ( sup_sup @ A @ A3 @ ( sup_sup @ A @ A3 @ B4 ) )
= ( sup_sup @ A @ A3 @ B4 ) ) ) ).
% sup.left_idem
thf(fact_177_sup__left__idem,axiom,
! [A: $tType] :
( ( semilattice_sup @ A )
=> ! [X3: A,Y: A] :
( ( sup_sup @ A @ X3 @ ( sup_sup @ A @ X3 @ Y ) )
= ( sup_sup @ A @ X3 @ Y ) ) ) ).
% sup_left_idem
thf(fact_178_sup_Oright__idem,axiom,
! [A: $tType] :
( ( semilattice_sup @ A )
=> ! [A3: A,B4: A] :
( ( sup_sup @ A @ ( sup_sup @ A @ A3 @ B4 ) @ B4 )
= ( sup_sup @ A @ A3 @ B4 ) ) ) ).
% sup.right_idem
thf(fact_179_sup__bot__left,axiom,
! [A: $tType] :
( ( bounde1808546759up_bot @ A )
=> ! [X3: A] :
( ( sup_sup @ A @ ( bot_bot @ A ) @ X3 )
= X3 ) ) ).
% sup_bot_left
thf(fact_180_sup__bot__right,axiom,
! [A: $tType] :
( ( bounde1808546759up_bot @ A )
=> ! [X3: A] :
( ( sup_sup @ A @ X3 @ ( bot_bot @ A ) )
= X3 ) ) ).
% sup_bot_right
thf(fact_181_bot__eq__sup__iff,axiom,
! [A: $tType] :
( ( bounde1808546759up_bot @ A )
=> ! [X3: A,Y: A] :
( ( ( bot_bot @ A )
= ( sup_sup @ A @ X3 @ Y ) )
= ( ( X3
= ( bot_bot @ A ) )
& ( Y
= ( bot_bot @ A ) ) ) ) ) ).
% bot_eq_sup_iff
thf(fact_182_psubsetD,axiom,
! [A: $tType,A4: set @ A,B5: set @ A,C2: A] :
( ( ord_less @ ( set @ A ) @ A4 @ B5 )
=> ( ( member @ A @ C2 @ A4 )
=> ( member @ A @ C2 @ B5 ) ) ) ).
% psubsetD
thf(fact_183_psubset__trans,axiom,
! [A: $tType,A4: set @ A,B5: set @ A,C3: set @ A] :
( ( ord_less @ ( set @ A ) @ A4 @ B5 )
=> ( ( ord_less @ ( set @ A ) @ B5 @ C3 )
=> ( ord_less @ ( set @ A ) @ A4 @ C3 ) ) ) ).
% psubset_trans
thf(fact_184_fun__diff__def,axiom,
! [B: $tType,A: $tType] :
( ( minus @ B )
=> ( ( minus_minus @ ( A > B ) )
= ( ^ [A6: A > B,B7: A > B,X4: A] : ( minus_minus @ B @ ( A6 @ X4 ) @ ( B7 @ X4 ) ) ) ) ) ).
% fun_diff_def
thf(fact_185_inf__sup__aci_I8_J,axiom,
! [A: $tType] :
( ( lattice @ A )
=> ! [X3: A,Y: A] :
( ( sup_sup @ A @ X3 @ ( sup_sup @ A @ X3 @ Y ) )
= ( sup_sup @ A @ X3 @ Y ) ) ) ).
% inf_sup_aci(8)
thf(fact_186_inf__sup__aci_I7_J,axiom,
! [A: $tType] :
( ( lattice @ A )
=> ! [X3: A,Y: A,Z3: A] :
( ( sup_sup @ A @ X3 @ ( sup_sup @ A @ Y @ Z3 ) )
= ( sup_sup @ A @ Y @ ( sup_sup @ A @ X3 @ Z3 ) ) ) ) ).
% inf_sup_aci(7)
thf(fact_187_inf__sup__aci_I6_J,axiom,
! [A: $tType] :
( ( lattice @ A )
=> ! [X3: A,Y: A,Z3: A] :
( ( sup_sup @ A @ ( sup_sup @ A @ X3 @ Y ) @ Z3 )
= ( sup_sup @ A @ X3 @ ( sup_sup @ A @ Y @ Z3 ) ) ) ) ).
% inf_sup_aci(6)
thf(fact_188_inf__sup__aci_I5_J,axiom,
! [A: $tType] :
( ( lattice @ A )
=> ( ( sup_sup @ A )
= ( ^ [X4: A,Y4: A] : ( sup_sup @ A @ Y4 @ X4 ) ) ) ) ).
% inf_sup_aci(5)
thf(fact_189_sup__fun__def,axiom,
! [B: $tType,A: $tType] :
( ( semilattice_sup @ B )
=> ( ( sup_sup @ ( A > B ) )
= ( ^ [F4: A > B,G3: A > B,X4: A] : ( sup_sup @ B @ ( F4 @ X4 ) @ ( G3 @ X4 ) ) ) ) ) ).
% sup_fun_def
thf(fact_190_boolean__algebra__cancel_Osup1,axiom,
! [A: $tType] :
( ( semilattice_sup @ A )
=> ! [A4: A,K: A,A3: A,B4: A] :
( ( A4
= ( sup_sup @ A @ K @ A3 ) )
=> ( ( sup_sup @ A @ A4 @ B4 )
= ( sup_sup @ A @ K @ ( sup_sup @ A @ A3 @ B4 ) ) ) ) ) ).
% boolean_algebra_cancel.sup1
thf(fact_191_boolean__algebra__cancel_Osup2,axiom,
! [A: $tType] :
( ( semilattice_sup @ A )
=> ! [B5: A,K: A,B4: A,A3: A] :
( ( B5
= ( sup_sup @ A @ K @ B4 ) )
=> ( ( sup_sup @ A @ A3 @ B5 )
= ( sup_sup @ A @ K @ ( sup_sup @ A @ A3 @ B4 ) ) ) ) ) ).
% boolean_algebra_cancel.sup2
thf(fact_192_sup_Oassoc,axiom,
! [A: $tType] :
( ( semilattice_sup @ A )
=> ! [A3: A,B4: A,C2: A] :
( ( sup_sup @ A @ ( sup_sup @ A @ A3 @ B4 ) @ C2 )
= ( sup_sup @ A @ A3 @ ( sup_sup @ A @ B4 @ C2 ) ) ) ) ).
% sup.assoc
thf(fact_193_sup__assoc,axiom,
! [A: $tType] :
( ( semilattice_sup @ A )
=> ! [X3: A,Y: A,Z3: A] :
( ( sup_sup @ A @ ( sup_sup @ A @ X3 @ Y ) @ Z3 )
= ( sup_sup @ A @ X3 @ ( sup_sup @ A @ Y @ Z3 ) ) ) ) ).
% sup_assoc
thf(fact_194_sup_Ocommute,axiom,
! [A: $tType] :
( ( semilattice_sup @ A )
=> ( ( sup_sup @ A )
= ( ^ [A2: A,B2: A] : ( sup_sup @ A @ B2 @ A2 ) ) ) ) ).
% sup.commute
thf(fact_195_sup__commute,axiom,
! [A: $tType] :
( ( semilattice_sup @ A )
=> ( ( sup_sup @ A )
= ( ^ [X4: A,Y4: A] : ( sup_sup @ A @ Y4 @ X4 ) ) ) ) ).
% sup_commute
thf(fact_196_sup_Oleft__commute,axiom,
! [A: $tType] :
( ( semilattice_sup @ A )
=> ! [B4: A,A3: A,C2: A] :
( ( sup_sup @ A @ B4 @ ( sup_sup @ A @ A3 @ C2 ) )
= ( sup_sup @ A @ A3 @ ( sup_sup @ A @ B4 @ C2 ) ) ) ) ).
% sup.left_commute
thf(fact_197_sup__left__commute,axiom,
! [A: $tType] :
( ( semilattice_sup @ A )
=> ! [X3: A,Y: A,Z3: A] :
( ( sup_sup @ A @ X3 @ ( sup_sup @ A @ Y @ Z3 ) )
= ( sup_sup @ A @ Y @ ( sup_sup @ A @ X3 @ Z3 ) ) ) ) ).
% sup_left_commute
thf(fact_198_less__supI1,axiom,
! [A: $tType] :
( ( semilattice_sup @ A )
=> ! [X3: A,A3: A,B4: A] :
( ( ord_less @ A @ X3 @ A3 )
=> ( ord_less @ A @ X3 @ ( sup_sup @ A @ A3 @ B4 ) ) ) ) ).
% less_supI1
thf(fact_199_less__supI2,axiom,
! [A: $tType] :
( ( semilattice_sup @ A )
=> ! [X3: A,B4: A,A3: A] :
( ( ord_less @ A @ X3 @ B4 )
=> ( ord_less @ A @ X3 @ ( sup_sup @ A @ A3 @ B4 ) ) ) ) ).
% less_supI2
thf(fact_200_sup_Ostrict__boundedE,axiom,
! [A: $tType] :
( ( semilattice_sup @ A )
=> ! [B4: A,C2: A,A3: A] :
( ( ord_less @ A @ ( sup_sup @ A @ B4 @ C2 ) @ A3 )
=> ~ ( ( ord_less @ A @ B4 @ A3 )
=> ~ ( ord_less @ A @ C2 @ A3 ) ) ) ) ).
% sup.strict_boundedE
thf(fact_201_sup_Ostrict__order__iff,axiom,
! [A: $tType] :
( ( semilattice_sup @ A )
=> ( ( ord_less @ A )
= ( ^ [B2: A,A2: A] :
( ( A2
= ( sup_sup @ A @ A2 @ B2 ) )
& ( A2 != B2 ) ) ) ) ) ).
% sup.strict_order_iff
thf(fact_202_sup_Ostrict__coboundedI1,axiom,
! [A: $tType] :
( ( semilattice_sup @ A )
=> ! [C2: A,A3: A,B4: A] :
( ( ord_less @ A @ C2 @ A3 )
=> ( ord_less @ A @ C2 @ ( sup_sup @ A @ A3 @ B4 ) ) ) ) ).
% sup.strict_coboundedI1
thf(fact_203_sup_Ostrict__coboundedI2,axiom,
! [A: $tType] :
( ( semilattice_sup @ A )
=> ! [C2: A,B4: A,A3: A] :
( ( ord_less @ A @ C2 @ B4 )
=> ( ord_less @ A @ C2 @ ( sup_sup @ A @ A3 @ B4 ) ) ) ) ).
% sup.strict_coboundedI2
thf(fact_204_h2,axiom,
( ( binary1610619414edTree @ a @ h @ t2 )
=> ( ( binary1653327646_setOf @ a @ ( binary1830089824insert @ a @ h @ e @ t2 ) )
= ( sup_sup @ ( set @ a ) @ ( minus_minus @ ( set @ a ) @ ( binary1653327646_setOf @ a @ t2 ) @ ( binary64540844le_eqs @ a @ h @ e ) ) @ ( insert @ a @ e @ ( bot_bot @ ( set @ a ) ) ) ) ) ) ).
% h2
thf(fact_205_h1,axiom,
( ( binary1610619414edTree @ a @ h @ t1 )
=> ( ( binary1653327646_setOf @ a @ ( binary1830089824insert @ a @ h @ e @ t1 ) )
= ( sup_sup @ ( set @ a ) @ ( minus_minus @ ( set @ a ) @ ( binary1653327646_setOf @ a @ t1 ) @ ( binary64540844le_eqs @ a @ h @ e ) ) @ ( insert @ a @ e @ ( bot_bot @ ( set @ a ) ) ) ) ) ) ).
% h1
thf(fact_206__092_060open_062sortedTree_Ah_ATip_A_092_060longrightarrow_062_AsetOf_A_Ibinsert_Ah_Ae_ATip_J_A_061_AsetOf_ATip_A_N_Aeqs_Ah_Ae_A_092_060union_062_A_123e_125_092_060close_062,axiom,
( ( binary1610619414edTree @ a @ h @ ( binary1746293266le_Tip @ a ) )
=> ( ( binary1653327646_setOf @ a @ ( binary1830089824insert @ a @ h @ e @ ( binary1746293266le_Tip @ a ) ) )
= ( sup_sup @ ( set @ a ) @ ( minus_minus @ ( set @ a ) @ ( binary1653327646_setOf @ a @ ( binary1746293266le_Tip @ a ) ) @ ( binary64540844le_eqs @ a @ h @ e ) ) @ ( insert @ a @ e @ ( bot_bot @ ( set @ a ) ) ) ) ) ) ).
% \<open>sortedTree h Tip \<longrightarrow> setOf (binsert h e Tip) = setOf Tip - eqs h e \<union> {e}\<close>
thf(fact_207_singleton__conv,axiom,
! [A: $tType,A3: A] :
( ( collect @ A
@ ^ [X4: A] : X4 = A3 )
= ( insert @ A @ A3 @ ( bot_bot @ ( set @ A ) ) ) ) ).
% singleton_conv
thf(fact_208_singleton__conv2,axiom,
! [A: $tType,A3: A] :
( ( collect @ A
@ ( ^ [Y5: A,Z4: A] : Y5 = Z4
@ A3 ) )
= ( insert @ A @ A3 @ ( bot_bot @ ( set @ A ) ) ) ) ).
% singleton_conv2
thf(fact_209_Un__def,axiom,
! [A: $tType] :
( ( sup_sup @ ( set @ A ) )
= ( ^ [A6: set @ A,B7: set @ A] :
( collect @ A
@ ^ [X4: A] :
( ( member @ A @ X4 @ A6 )
| ( member @ A @ X4 @ B7 ) ) ) ) ) ).
% Un_def
thf(fact_210_empty__def,axiom,
! [A: $tType] :
( ( bot_bot @ ( set @ A ) )
= ( collect @ A
@ ^ [X4: A] : $false ) ) ).
% empty_def
thf(fact_211_insert__def,axiom,
! [A: $tType] :
( ( insert @ A )
= ( ^ [A2: A] :
( sup_sup @ ( set @ A )
@ ( collect @ A
@ ^ [X4: A] : X4 = A2 ) ) ) ) ).
% insert_def
thf(fact_212_sup__set__def,axiom,
! [A: $tType] :
( ( sup_sup @ ( set @ A ) )
= ( ^ [A6: set @ A,B7: set @ A] :
( collect @ A
@ ( sup_sup @ ( A > $o )
@ ^ [X4: A] : ( member @ A @ X4 @ A6 )
@ ^ [X4: A] : ( member @ A @ X4 @ B7 ) ) ) ) ) ).
% sup_set_def
thf(fact_213_Collect__conv__if,axiom,
! [A: $tType,P: A > $o,A3: A] :
( ( ( P @ A3 )
=> ( ( collect @ A
@ ^ [X4: A] :
( ( X4 = A3 )
& ( P @ X4 ) ) )
= ( insert @ A @ A3 @ ( bot_bot @ ( set @ A ) ) ) ) )
& ( ~ ( P @ A3 )
=> ( ( collect @ A
@ ^ [X4: A] :
( ( X4 = A3 )
& ( P @ X4 ) ) )
= ( bot_bot @ ( set @ A ) ) ) ) ) ).
% Collect_conv_if
thf(fact_214_Collect__disj__eq,axiom,
! [A: $tType,P: A > $o,Q: A > $o] :
( ( collect @ A
@ ^ [X4: A] :
( ( P @ X4 )
| ( Q @ X4 ) ) )
= ( sup_sup @ ( set @ A ) @ ( collect @ A @ P ) @ ( collect @ A @ Q ) ) ) ).
% Collect_disj_eq
thf(fact_215_Collect__conv__if2,axiom,
! [A: $tType,P: A > $o,A3: A] :
( ( ( P @ A3 )
=> ( ( collect @ A
@ ^ [X4: A] :
( ( A3 = X4 )
& ( P @ X4 ) ) )
= ( insert @ A @ A3 @ ( bot_bot @ ( set @ A ) ) ) ) )
& ( ~ ( P @ A3 )
=> ( ( collect @ A
@ ^ [X4: A] :
( ( A3 = X4 )
& ( P @ X4 ) ) )
= ( bot_bot @ ( set @ A ) ) ) ) ) ).
% Collect_conv_if2
thf(fact_216_less__set__def,axiom,
! [A: $tType] :
( ( ord_less @ ( set @ A ) )
= ( ^ [A6: set @ A,B7: set @ A] :
( ord_less @ ( A > $o )
@ ^ [X4: A] : ( member @ A @ X4 @ A6 )
@ ^ [X4: A] : ( member @ A @ X4 @ B7 ) ) ) ) ).
% less_set_def
thf(fact_217_Tree_Ocase__distrib,axiom,
! [C: $tType,B: $tType,A: $tType,H: B > C,F1: B,F22: ( binary1291135688e_Tree @ A ) > A > ( binary1291135688e_Tree @ A ) > B,Tree: binary1291135688e_Tree @ A] :
( ( H @ ( binary536355927e_Tree @ B @ A @ F1 @ F22 @ Tree ) )
= ( binary536355927e_Tree @ C @ A @ ( H @ F1 )
@ ^ [X12: binary1291135688e_Tree @ A,X25: A,X33: binary1291135688e_Tree @ A] : ( H @ ( F22 @ X12 @ X25 @ X33 ) )
@ Tree ) ) ).
% Tree.case_distrib
thf(fact_218_Tree_Opred__True,axiom,
! [A: $tType] :
( ( binary1693644968d_Tree @ A
@ ^ [Uu: A] : $true )
= ( ^ [Uu: binary1291135688e_Tree @ A] : $true ) ) ).
% Tree.pred_True
thf(fact_219_eqs__def,axiom,
! [A: $tType] :
( ( binary64540844le_eqs @ A )
= ( ^ [H2: A > int,X4: A] :
( collect @ A
@ ^ [Y4: A] :
( ( H2 @ Y4 )
= ( H2 @ X4 ) ) ) ) ) ).
% eqs_def
thf(fact_220_insert__Collect,axiom,
! [A: $tType,A3: A,P: A > $o] :
( ( insert @ A @ A3 @ ( collect @ A @ P ) )
= ( collect @ A
@ ^ [U: A] :
( ( U != A3 )
=> ( P @ U ) ) ) ) ).
% insert_Collect
thf(fact_221_minus__set__def,axiom,
! [A: $tType] :
( ( minus_minus @ ( set @ A ) )
= ( ^ [A6: set @ A,B7: set @ A] :
( collect @ A
@ ( minus_minus @ ( A > $o )
@ ^ [X4: A] : ( member @ A @ X4 @ A6 )
@ ^ [X4: A] : ( member @ A @ X4 @ B7 ) ) ) ) ) ).
% minus_set_def
thf(fact_222_insert__compr,axiom,
! [A: $tType] :
( ( insert @ A )
= ( ^ [A2: A,B7: set @ A] :
( collect @ A
@ ^ [X4: A] :
( ( X4 = A2 )
| ( member @ A @ X4 @ B7 ) ) ) ) ) ).
% insert_compr
thf(fact_223_set__diff__eq,axiom,
! [A: $tType] :
( ( minus_minus @ ( set @ A ) )
= ( ^ [A6: set @ A,B7: set @ A] :
( collect @ A
@ ^ [X4: A] :
( ( member @ A @ X4 @ A6 )
& ~ ( member @ A @ X4 @ B7 ) ) ) ) ) ).
% set_diff_eq
thf(fact_224_the__elem__eq,axiom,
! [A: $tType,X3: A] :
( ( the_elem @ A @ ( insert @ A @ X3 @ ( bot_bot @ ( set @ A ) ) ) )
= X3 ) ).
% the_elem_eq
thf(fact_225_bot__empty__eq,axiom,
! [A: $tType] :
( ( bot_bot @ ( A > $o ) )
= ( ^ [X4: A] : ( member @ A @ X4 @ ( bot_bot @ ( set @ A ) ) ) ) ) ).
% bot_empty_eq
thf(fact_226_sup1CI,axiom,
! [A: $tType,B5: A > $o,X3: A,A4: A > $o] :
( ( ~ ( B5 @ X3 )
=> ( A4 @ X3 ) )
=> ( sup_sup @ ( A > $o ) @ A4 @ B5 @ X3 ) ) ).
% sup1CI
thf(fact_227_sup1E,axiom,
! [A: $tType,A4: A > $o,B5: A > $o,X3: A] :
( ( sup_sup @ ( A > $o ) @ A4 @ B5 @ X3 )
=> ( ~ ( A4 @ X3 )
=> ( B5 @ X3 ) ) ) ).
% sup1E
thf(fact_228_sup1I1,axiom,
! [A: $tType,A4: A > $o,X3: A,B5: A > $o] :
( ( A4 @ X3 )
=> ( sup_sup @ ( A > $o ) @ A4 @ B5 @ X3 ) ) ).
% sup1I1
thf(fact_229_sup1I2,axiom,
! [A: $tType,B5: A > $o,X3: A,A4: A > $o] :
( ( B5 @ X3 )
=> ( sup_sup @ ( A > $o ) @ A4 @ B5 @ X3 ) ) ).
% sup1I2
thf(fact_230_sup__Un__eq,axiom,
! [A: $tType,R2: set @ A,S: set @ A] :
( ( sup_sup @ ( A > $o )
@ ^ [X4: A] : ( member @ A @ X4 @ R2 )
@ ^ [X4: A] : ( member @ A @ X4 @ S ) )
= ( ^ [X4: A] : ( member @ A @ X4 @ ( sup_sup @ ( set @ A ) @ R2 @ S ) ) ) ) ).
% sup_Un_eq
thf(fact_231_Collect__empty__eq__bot,axiom,
! [A: $tType,P: A > $o] :
( ( ( collect @ A @ P )
= ( bot_bot @ ( set @ A ) ) )
= ( P
= ( bot_bot @ ( A > $o ) ) ) ) ).
% Collect_empty_eq_bot
thf(fact_232_is__singleton__the__elem,axiom,
! [A: $tType] :
( ( is_singleton @ A )
= ( ^ [A6: set @ A] :
( A6
= ( insert @ A @ ( the_elem @ A @ A6 ) @ ( bot_bot @ ( set @ A ) ) ) ) ) ) ).
% is_singleton_the_elem
thf(fact_233_is__singletonI,axiom,
! [A: $tType,X3: A] : ( is_singleton @ A @ ( insert @ A @ X3 @ ( bot_bot @ ( set @ A ) ) ) ) ).
% is_singletonI
thf(fact_234_is__singletonI_H,axiom,
! [A: $tType,A4: set @ A] :
( ( A4
!= ( bot_bot @ ( set @ A ) ) )
=> ( ! [X2: A,Y2: A] :
( ( member @ A @ X2 @ A4 )
=> ( ( member @ A @ Y2 @ A4 )
=> ( X2 = Y2 ) ) )
=> ( is_singleton @ A @ A4 ) ) ) ).
% is_singletonI'
thf(fact_235_is__singleton__def,axiom,
! [A: $tType] :
( ( is_singleton @ A )
= ( ^ [A6: set @ A] :
? [X4: A] :
( A6
= ( insert @ A @ X4 @ ( bot_bot @ ( set @ A ) ) ) ) ) ) ).
% is_singleton_def
thf(fact_236_is__singletonE,axiom,
! [A: $tType,A4: set @ A] :
( ( is_singleton @ A @ A4 )
=> ~ ! [X2: A] :
( A4
!= ( insert @ A @ X2 @ ( bot_bot @ ( set @ A ) ) ) ) ) ).
% is_singletonE
thf(fact_237_diff__strict__right__mono,axiom,
! [A: $tType] :
( ( ordered_ab_group_add @ A )
=> ! [A3: A,B4: A,C2: A] :
( ( ord_less @ A @ A3 @ B4 )
=> ( ord_less @ A @ ( minus_minus @ A @ A3 @ C2 ) @ ( minus_minus @ A @ B4 @ C2 ) ) ) ) ).
% diff_strict_right_mono
thf(fact_238_diff__strict__left__mono,axiom,
! [A: $tType] :
( ( ordered_ab_group_add @ A )
=> ! [B4: A,A3: A,C2: A] :
( ( ord_less @ A @ B4 @ A3 )
=> ( ord_less @ A @ ( minus_minus @ A @ C2 @ A3 ) @ ( minus_minus @ A @ C2 @ B4 ) ) ) ) ).
% diff_strict_left_mono
thf(fact_239_diff__eq__diff__eq,axiom,
! [A: $tType] :
( ( group_add @ A )
=> ! [A3: A,B4: A,C2: A,D2: A] :
( ( ( minus_minus @ A @ A3 @ B4 )
= ( minus_minus @ A @ C2 @ D2 ) )
=> ( ( A3 = B4 )
= ( C2 = D2 ) ) ) ) ).
% diff_eq_diff_eq
thf(fact_240_diff__right__commute,axiom,
! [A: $tType] :
( ( cancel146912293up_add @ A )
=> ! [A3: A,C2: A,B4: A] :
( ( minus_minus @ A @ ( minus_minus @ A @ A3 @ C2 ) @ B4 )
= ( minus_minus @ A @ ( minus_minus @ A @ A3 @ B4 ) @ C2 ) ) ) ).
% diff_right_commute
thf(fact_241_diff__strict__mono,axiom,
! [A: $tType] :
( ( ordered_ab_group_add @ A )
=> ! [A3: A,B4: A,D2: A,C2: A] :
( ( ord_less @ A @ A3 @ B4 )
=> ( ( ord_less @ A @ D2 @ C2 )
=> ( ord_less @ A @ ( minus_minus @ A @ A3 @ C2 ) @ ( minus_minus @ A @ B4 @ D2 ) ) ) ) ) ).
% diff_strict_mono
thf(fact_242_diff__eq__diff__less,axiom,
! [A: $tType] :
( ( ordered_ab_group_add @ A )
=> ! [A3: A,B4: A,C2: A,D2: A] :
( ( ( minus_minus @ A @ A3 @ B4 )
= ( minus_minus @ A @ C2 @ D2 ) )
=> ( ( ord_less @ A @ A3 @ B4 )
= ( ord_less @ A @ C2 @ D2 ) ) ) ) ).
% diff_eq_diff_less
thf(fact_243_remove__def,axiom,
! [A: $tType] :
( ( remove @ A )
= ( ^ [X4: A,A6: set @ A] : ( minus_minus @ ( set @ A ) @ A6 @ ( insert @ A @ X4 @ ( bot_bot @ ( set @ A ) ) ) ) ) ) ).
% remove_def
thf(fact_244_Tree_Osimps_I15_J,axiom,
! [A: $tType,X21: binary1291135688e_Tree @ A,X22: A,X23: binary1291135688e_Tree @ A] :
( ( binary2130109271t_Tree @ A @ ( binary210054475elle_T @ A @ X21 @ X22 @ X23 ) )
= ( sup_sup @ ( set @ A ) @ ( sup_sup @ ( set @ A ) @ ( binary2130109271t_Tree @ A @ X21 ) @ ( insert @ A @ X22 @ ( bot_bot @ ( set @ A ) ) ) ) @ ( binary2130109271t_Tree @ A @ X23 ) ) ) ).
% Tree.simps(15)
thf(fact_245_member__remove,axiom,
! [A: $tType,X3: A,Y: A,A4: set @ A] :
( ( member @ A @ X3 @ ( remove @ A @ Y @ A4 ) )
= ( ( member @ A @ X3 @ A4 )
& ( X3 != Y ) ) ) ).
% member_remove
thf(fact_246_Tree_Osimps_I14_J,axiom,
! [A: $tType] :
( ( binary2130109271t_Tree @ A @ ( binary1746293266le_Tip @ A ) )
= ( bot_bot @ ( set @ A ) ) ) ).
% Tree.simps(14)
thf(fact_247_Tree_Oset__intros_I3_J,axiom,
! [A: $tType,Ya: A,X23: binary1291135688e_Tree @ A,X21: binary1291135688e_Tree @ A,X22: A] :
( ( member @ A @ Ya @ ( binary2130109271t_Tree @ A @ X23 ) )
=> ( member @ A @ Ya @ ( binary2130109271t_Tree @ A @ ( binary210054475elle_T @ A @ X21 @ X22 @ X23 ) ) ) ) ).
% Tree.set_intros(3)
thf(fact_248_Tree_Oset__intros_I2_J,axiom,
! [A: $tType,X22: A,X21: binary1291135688e_Tree @ A,X23: binary1291135688e_Tree @ A] : ( member @ A @ X22 @ ( binary2130109271t_Tree @ A @ ( binary210054475elle_T @ A @ X21 @ X22 @ X23 ) ) ) ).
% Tree.set_intros(2)
thf(fact_249_Tree_Oset__intros_I1_J,axiom,
! [A: $tType,Y: A,X21: binary1291135688e_Tree @ A,X22: A,X23: binary1291135688e_Tree @ A] :
( ( member @ A @ Y @ ( binary2130109271t_Tree @ A @ X21 ) )
=> ( member @ A @ Y @ ( binary2130109271t_Tree @ A @ ( binary210054475elle_T @ A @ X21 @ X22 @ X23 ) ) ) ) ).
% Tree.set_intros(1)
thf(fact_250_Tree_Oset__cases,axiom,
! [A: $tType,E: A,A3: binary1291135688e_Tree @ A] :
( ( member @ A @ E @ ( binary2130109271t_Tree @ A @ A3 ) )
=> ( ! [Z1: binary1291135688e_Tree @ A] :
( ? [Z22: A,Z32: binary1291135688e_Tree @ A] :
( A3
= ( binary210054475elle_T @ A @ Z1 @ Z22 @ Z32 ) )
=> ~ ( member @ A @ E @ ( binary2130109271t_Tree @ A @ Z1 ) ) )
=> ( ! [Z1: binary1291135688e_Tree @ A,Z32: binary1291135688e_Tree @ A] :
( A3
!= ( binary210054475elle_T @ A @ Z1 @ E @ Z32 ) )
=> ~ ! [Z1: binary1291135688e_Tree @ A,Z22: A,Z32: binary1291135688e_Tree @ A] :
( ( A3
= ( binary210054475elle_T @ A @ Z1 @ Z22 @ Z32 ) )
=> ~ ( member @ A @ E @ ( binary2130109271t_Tree @ A @ Z32 ) ) ) ) ) ) ).
% Tree.set_cases
thf(fact_251_Tree_Opred__cong,axiom,
! [A: $tType,X3: binary1291135688e_Tree @ A,Ya: binary1291135688e_Tree @ A,P: A > $o,Pa: A > $o] :
( ( X3 = Ya )
=> ( ! [Z: A] :
( ( member @ A @ Z @ ( binary2130109271t_Tree @ A @ Ya ) )
=> ( ( P @ Z )
= ( Pa @ Z ) ) )
=> ( ( binary1693644968d_Tree @ A @ P @ X3 )
= ( binary1693644968d_Tree @ A @ Pa @ Ya ) ) ) ) ).
% Tree.pred_cong
thf(fact_252_Tree_Opred__mono__strong,axiom,
! [A: $tType,P: A > $o,X3: binary1291135688e_Tree @ A,Pa: A > $o] :
( ( binary1693644968d_Tree @ A @ P @ X3 )
=> ( ! [Z: A] :
( ( member @ A @ Z @ ( binary2130109271t_Tree @ A @ X3 ) )
=> ( ( P @ Z )
=> ( Pa @ Z ) ) )
=> ( binary1693644968d_Tree @ A @ Pa @ X3 ) ) ) ).
% Tree.pred_mono_strong
thf(fact_253_Set_Ois__empty__def,axiom,
! [A: $tType] :
( ( is_empty @ A )
= ( ^ [A6: set @ A] :
( A6
= ( bot_bot @ ( set @ A ) ) ) ) ) ).
% Set.is_empty_def
thf(fact_254_the__elem__def,axiom,
! [A: $tType] :
( ( the_elem @ A )
= ( ^ [X6: set @ A] :
( the @ A
@ ^ [X4: A] :
( X6
= ( insert @ A @ X4 @ ( bot_bot @ ( set @ A ) ) ) ) ) ) ) ).
% the_elem_def
thf(fact_255_psubset__insert__iff,axiom,
! [A: $tType,A4: set @ A,X3: A,B5: set @ A] :
( ( ord_less @ ( set @ A ) @ A4 @ ( insert @ A @ X3 @ B5 ) )
= ( ( ( member @ A @ X3 @ B5 )
=> ( ord_less @ ( set @ A ) @ A4 @ B5 ) )
& ( ~ ( member @ A @ X3 @ B5 )
=> ( ( ( member @ A @ X3 @ A4 )
=> ( ord_less @ ( set @ A ) @ ( minus_minus @ ( set @ A ) @ A4 @ ( insert @ A @ X3 @ ( bot_bot @ ( set @ A ) ) ) ) @ B5 ) )
& ( ~ ( member @ A @ X3 @ A4 )
=> ( ord_less_eq @ ( set @ A ) @ A4 @ B5 ) ) ) ) ) ) ).
% psubset_insert_iff
% Type constructors (44)
thf(tcon_HOL_Obool___Lattices_Obounded__lattice,axiom,
bounded_lattice @ $o ).
thf(tcon_Set_Oset___Lattices_Obounded__lattice_1,axiom,
! [A7: $tType] : ( bounded_lattice @ ( set @ A7 ) ) ).
thf(tcon_fun___Lattices_Obounded__lattice_2,axiom,
! [A7: $tType,A8: $tType] :
( ( bounded_lattice @ A8 )
=> ( bounded_lattice @ ( A7 > A8 ) ) ) ).
thf(tcon_fun___Lattices_Obounded__semilattice__sup__bot,axiom,
! [A7: $tType,A8: $tType] :
( ( bounded_lattice @ A8 )
=> ( bounde1808546759up_bot @ ( A7 > A8 ) ) ) ).
thf(tcon_fun___Lattices_Osemilattice__sup,axiom,
! [A7: $tType,A8: $tType] :
( ( semilattice_sup @ A8 )
=> ( semilattice_sup @ ( A7 > A8 ) ) ) ).
thf(tcon_fun___Orderings_Oorder__bot,axiom,
! [A7: $tType,A8: $tType] :
( ( order_bot @ A8 )
=> ( order_bot @ ( A7 > A8 ) ) ) ).
thf(tcon_fun___Orderings_Opreorder,axiom,
! [A7: $tType,A8: $tType] :
( ( preorder @ A8 )
=> ( preorder @ ( A7 > A8 ) ) ) ).
thf(tcon_fun___Lattices_Olattice,axiom,
! [A7: $tType,A8: $tType] :
( ( lattice @ A8 )
=> ( lattice @ ( A7 > A8 ) ) ) ).
thf(tcon_fun___Orderings_Oorder,axiom,
! [A7: $tType,A8: $tType] :
( ( order @ A8 )
=> ( order @ ( A7 > A8 ) ) ) ).
thf(tcon_fun___Orderings_Oord,axiom,
! [A7: $tType,A8: $tType] :
( ( ord @ A8 )
=> ( ord @ ( A7 > A8 ) ) ) ).
thf(tcon_fun___Orderings_Obot,axiom,
! [A7: $tType,A8: $tType] :
( ( bot @ A8 )
=> ( bot @ ( A7 > A8 ) ) ) ).
thf(tcon_fun___Groups_Ominus,axiom,
! [A7: $tType,A8: $tType] :
( ( minus @ A8 )
=> ( minus @ ( A7 > A8 ) ) ) ).
thf(tcon_Int_Oint___Groups_Ocancel__ab__semigroup__add,axiom,
cancel146912293up_add @ int ).
thf(tcon_Int_Oint___Groups_Oordered__ab__group__add,axiom,
ordered_ab_group_add @ int ).
thf(tcon_Int_Oint___Lattices_Osemilattice__sup_3,axiom,
semilattice_sup @ int ).
thf(tcon_Int_Oint___Rings_Olinordered__idom,axiom,
linordered_idom @ int ).
thf(tcon_Int_Oint___Orderings_Opreorder_4,axiom,
preorder @ int ).
thf(tcon_Int_Oint___Orderings_Olinorder,axiom,
linorder @ int ).
thf(tcon_Int_Oint___Orderings_Ono__top,axiom,
no_top @ int ).
thf(tcon_Int_Oint___Orderings_Ono__bot,axiom,
no_bot @ int ).
thf(tcon_Int_Oint___Lattices_Olattice_5,axiom,
lattice @ int ).
thf(tcon_Int_Oint___Groups_Ogroup__add,axiom,
group_add @ int ).
thf(tcon_Int_Oint___Orderings_Oorder_6,axiom,
order @ int ).
thf(tcon_Int_Oint___Orderings_Oord_7,axiom,
ord @ int ).
thf(tcon_Int_Oint___Groups_Ominus_8,axiom,
minus @ int ).
thf(tcon_Set_Oset___Lattices_Obounded__semilattice__sup__bot_9,axiom,
! [A7: $tType] : ( bounde1808546759up_bot @ ( set @ A7 ) ) ).
thf(tcon_Set_Oset___Lattices_Osemilattice__sup_10,axiom,
! [A7: $tType] : ( semilattice_sup @ ( set @ A7 ) ) ).
thf(tcon_Set_Oset___Orderings_Oorder__bot_11,axiom,
! [A7: $tType] : ( order_bot @ ( set @ A7 ) ) ).
thf(tcon_Set_Oset___Orderings_Opreorder_12,axiom,
! [A7: $tType] : ( preorder @ ( set @ A7 ) ) ).
thf(tcon_Set_Oset___Lattices_Olattice_13,axiom,
! [A7: $tType] : ( lattice @ ( set @ A7 ) ) ).
thf(tcon_Set_Oset___Orderings_Oorder_14,axiom,
! [A7: $tType] : ( order @ ( set @ A7 ) ) ).
thf(tcon_Set_Oset___Orderings_Oord_15,axiom,
! [A7: $tType] : ( ord @ ( set @ A7 ) ) ).
thf(tcon_Set_Oset___Orderings_Obot_16,axiom,
! [A7: $tType] : ( bot @ ( set @ A7 ) ) ).
thf(tcon_Set_Oset___Groups_Ominus_17,axiom,
! [A7: $tType] : ( minus @ ( set @ A7 ) ) ).
thf(tcon_HOL_Obool___Lattices_Obounded__semilattice__sup__bot_18,axiom,
bounde1808546759up_bot @ $o ).
thf(tcon_HOL_Obool___Lattices_Osemilattice__sup_19,axiom,
semilattice_sup @ $o ).
thf(tcon_HOL_Obool___Orderings_Oorder__bot_20,axiom,
order_bot @ $o ).
thf(tcon_HOL_Obool___Orderings_Opreorder_21,axiom,
preorder @ $o ).
thf(tcon_HOL_Obool___Orderings_Olinorder_22,axiom,
linorder @ $o ).
thf(tcon_HOL_Obool___Lattices_Olattice_23,axiom,
lattice @ $o ).
thf(tcon_HOL_Obool___Orderings_Oorder_24,axiom,
order @ $o ).
thf(tcon_HOL_Obool___Orderings_Oord_25,axiom,
ord @ $o ).
thf(tcon_HOL_Obool___Orderings_Obot_26,axiom,
bot @ $o ).
thf(tcon_HOL_Obool___Groups_Ominus_27,axiom,
minus @ $o ).
% Conjectures (1)
thf(conj_0,conjecture,
ord_less @ int @ ( h @ w ) @ ( h @ x ) ).
%------------------------------------------------------------------------------